Analyze the following peculiar algorithm to state the worst-case number of diamond (*) operations performed. You must use the tree/levels analysis technique. i 5 then t - ( - i + 1) / 2 peculiar (L, itt, i + 2t - 1) peculiar (L, i, i + t - 1) Show your work here: a) What is the input size in the base case? b) How many times is the essential operation performed in the base case? c) How many recursive calls are in one pass through the algorithm? d) How does the input size change on each recursive call? e) How many times is the essential operation performed in the recursive case? f) State the recursive T(n) function: T(n) = . Complete the tree/levels analysis: Level Instances Size of Each | # Operations in Instance each Instance Total Cost at this Level Sum of Total Costs at All Levels: Using Big-Oh notation, what is the growth rate of the T(n) function that represents the worst-case number of diamond (*) operations performed: Analyze the following peculiar algorithm to state the worst-case number of diamond (*) operations performed. You must use the tree/levels analysis technique. i 5 then t - ( - i + 1) / 2 peculiar (L, itt, i + 2t - 1) peculiar (L, i, i + t - 1) Show your work here: a) What is the input size in the base case? b) How many times is the essential operation performed in the base case? c) How many recursive calls are in one pass through the algorithm? d) How does the input size change on each recursive call? e) How many times is the essential operation performed in the recursive case? f) State the recursive T(n) function: T(n) = . Complete the tree/levels analysis: Level Instances Size of Each | # Operations in Instance each Instance Total Cost at this Level Sum of Total Costs at All Levels: Using Big-Oh notation, what is the growth rate of the T(n) function that represents the worst-case number of diamond (*) operations performed