recursion questions these questions are intended as self-test for readers answers may be found in appendix if the user enters in the triangle java program (listing )what is the maximum number of "copiesof the triangle(method (actually just copies of its argumentthat exist at any one time where are the copies of the argumentmentioned in question storeda in variable in the triangle(method in field of the triangleapp class in variable of the getstring(method on stack assume the user enters as in question what is the value of when the triangle(method first returns value other than assume the same situation as in question what is the value of when the triangle(method is about to return to main() true or falsein the triangle(methodthe return values are stored on the stack in the anagram java program (listing )at certain depth of recursiona version of the doanagram(method is working with the string "ledwhen this method calls new version of itselfwhat letters will the new version be working with we've seen that recursion can take the place of loopas in the loop-oriented orderedarray java program (listing and the recursive binarysearch java program (listing which of the following is not truea both programs divide the range repeatedly in half if the key is not foundthe loop version returns because the range bounds crossbut the recursive version occurs because it reaches the bottom recursion level if the key is foundthe loop version returns from the entire methodwhereas the recursive version returns from only one level of recursion in the recursive version the range to be searched must be specified in the argumentswhile in the loop version it need not be