[Solved]Let A1 A2 Input Array Let B Boolean Array Length N B1 Bn 1 I1 I2 Bi1 Bi2 1 Bj 0 I1 J I2 Q37088772

Let A = (a1, a2, . . . , an) bean input array and let B be a Boolean array of length n such thatb1 = bn = 1. For each i1 <i2 such that bi1= bi2=1 and bj=0for all i1 < j < i2, we wish to computethe prefix sums of the subarray (ai1+1, . . . ,ai2).Write pseudocode for an O(log (n)) algorithm thatuses O(n) operations.

Expert Answer

---

Answer to Let A = (a1, a2, . . . , an) be an input array and let B be a Boolean array of length n such that b1 = bn = 1. For each … . . .