The choice are: 3n/3n/2dn, n-1, 1, d, 4, 2, n, n/4

01 Magic (a1,,an : array of integers ) 02 if (n=1) 03 if (a1>8) return true 04 else return false 05 else if (Magic(a1,,an1) is true and Magic(a2,,an) is true) \ constant time to make smaller array 06 return true 07 else return false Let T(n) be the running time of Magic Complete the recursive definition of T(n) by choosing values for X,Y, and Z using the dropdowns below. T(1)=bT(n)=XT(Y)+Z