_{1},......,a

_{n}and b

_{1},......, b

_{n}where each number is 0 or 1, the fastest algorithm to find the largest span (i, j) such that a

_{i}+a

_{i+1}......a

_{j}= b

_{i}+b

_{i+1}......b

_{j}or report that there is not such span,

A 3-ary max heap is like a binary max heap, but instead of 2 children, nodes have 3 children. A 3-ary heap can be represented by an array as follows: The root is stored in the first location, a[0], nodes in the next level, from left to right, is stored from a[1] to a[3]. The nodes from the second level of the tree from left to right are stored from a[4] location onward. An item x can be inserted into a 3-ary heap containing n items by placing x in the location a[n] and pushing it up the tree to satisfy the heap property.

Suppose the elements 7, 2, 10 and 4 are inserted, in that order, into the valid 3- ary max heap found in the previous question. Which one of the following is the sequence of items in the array representing the resultant heap?

(Hint : Use a heap data structure)