Dont mind the work that i did

8. (10 points) Below a recursive dynamic program, similar to the memoized Fibonacci program that we saw. You will have to specify two orders: the order that recursive calls are made to the program, and the order that the table gets filled in. The assumption is that the recursive evaluation happens left to right. Show the recursive structure of the recursive calls to BILBOBAGG?NS when SETUP is called, the order that T gets filled in (within those recursive calls), and the values in the T. 816. SETUP) ( int T10, 1, 2, 3, 4, 5, 6] = {0, 2, 3,-1,-1,-1,-1 return BILBOBAGGINS(6, T) 40 BILBOBAGGINS(i, T) )I if(T]