**Consider the following problem↵
==================:**↵
↵
Given an initial array of"n"$n$ integers and "q"$q$ queries of the form:↵
↵
I x V$I$ $x$ $V$ : Add V$V$ to the i$i$-th position on the vector. If it is not empty (equals 0) then add it between the position xs $x$ and $x + 1$.↵
↵
S x y$S$ $x$ $y$ : Calculate the sum of all elements from index $x$ to y$y$, inclusively.↵
↵
My teacher has advisedto tryus to use *RMQ* or an o*Offline Segment Tree* for this one, but i would like to know if there´s a way of adapting the Fenwick Tree to support this sort of "*shift"* that may need to be done on the vector efficiently.
==================
↵
Given an initial array of
↵
↵
↵
My teacher has advised
