Complete the tree/levels table to analyze the following mystery algorithm in terms of the worst-case number of diamond operations ( 0 ) performed. Algorithm mystery (A,min, max) Input an array, A, of n elements a minimum index to consider, where minmax a maximum index to consider, where minmax Output ??????? (this algorithm doesn't do anything useful) if A[min]A[max] then temp +A[min]2 A[min]+A[max] A[max]+temp if (max min+1)