2. (10p) Complete the time complexity analysis for the prefixAvg algorithm a. Call prefixAvg (A,n) Assume: A=[2,3,1,5,6] and n=5 How many times does line 2 is executed: How many times does line 4 is executed: How many times does line 5 is executed: How many times does line 6 is executed: The sum of the above 4 numbers: = b. Call prefixAvg (A,n) where array A has the size of n items in it How many times does line 2 repeated in terms of n : How many times does line 4 repeated in terms of n : How many times does line 5 repeated in terms of n : How many times does line 6 is executed: The sum of the above 4 numbers: =