Consider the following recursive algorithm. ALGORITHM Riddle(A[0..n–1]) //Input:AnarrayA[0..n –1]of real numbers if n =1 returnA[0] else tempe-Riddle(A[0..n–2]) if temp

answer only 100% acurate

else downvote and report the answer for sure

Extracted text: Consider the following recursive algorithm. ALGORITHM Riddle(A[0..n–1]) //Input:AnarrayA[0..n –1]of real numbers if n =1 returnA[0] else tempe-Riddle(A[0..n–2]) if temp < a[n-1]="" return="" temp="" else="" returna[n-1]="" a.="" what="" does="" this="" algorithm="" compute?="" b.="" set="" up="" a="" recurrence="" relation="" for="" the="" algorithm's="" basic="" operation="" count="" and="" solve="">