Considered an ordered (sorted) array where each element z Z, i.e such that A[z] 1]Vi. Now,consider the problem of finding the sum of array All, veey n| where each item in the Array is a digit (0, .., 9). Can we do it in O(log n) time? Justify your solution. For each of these parts, indicate whether f = O(g), f = (4g), or both (ie., f = O(g)). In each case, give a brief justification for your answer. (Hint: It may help to plot the functions and obtain an estimate of their relative growth rates. In some cases, it may also help to express each function as a power of 2 and then compare.)

Attachments:

Assignment.docx