Compito๐ shown in EN
๐ **Question:** Build segment tree from [1,2,3,4,5]. Query sum [1..3] (=2+3+4=9). Update index 2 to 10. Query [1..3] again (=2+10+4=16). Print both.
๐ Pick the right answer.
๐ก **Hint:** Re-read the theory above if unsure.