Computer science recursive problem Suppose I have a recursivefunction called fun that process a list by repeatedly subdividingand operating on halves of the list. The base case is when thefunction is asked to operate on a function of size 1. Suppose itrequires performing the following step: fun(left) + fun(right). Ifeach function call consumes 100 bytes of memory, how many byteswill be on the activation stack when the function is at its peakmemory consumption for a list of size 8?
Expert Answer
An answer will be send to you shortly. . . . .