recursion and control goes to simmeth()' exit (case if notit calls itself recursively (case this recursive call consists of pushing - and return address of onto the stackand going to the method entry at case on the return from the recursive callsimmeth(adds its argument to the value returned from the call finallyit exits (case when it exitsit pops the last params object off the stackthis information is no longer needed the return address given in the initial call was so case is the place where control goes when the method returns this code returns true to let the while loop in rectriangle(know that the loop is over note that in this description of simmeth()' operation we use terms like argumentrecursive calland return address to mean simulations of these featuresnot the normal java versions if you inserted some output statements in each case to see what simmeth(was doingyou could arrange for output like thisenter number case theanswer= stackcase theanswer= stack( case theanswer= stack( case theanswer= stack( ( case theanswer= stack( ( case theanswer= stack( ( ( case theanswer= stack( ( ( case theanswer= stack( ( ( ( case theanswer= stack( ( ( ( case theanswer= stack( ( ( case theanswer= stack( ( ( case theanswer= stack( ( case theanswer= stack( ( case theanswer= stack( case theanswer= stack( case theanswer= stacktriangle= the case number shows what section of code is being executed the contents of the stack (consisting of params objects containing followed by return addressare also shown the simmeth(method is entered four times (case and returns four times (case only when it starts returning does theanswer begin to accumulate the results of the calculations