recursion ab cde bde bce abe figure bcd ade ace acd abd - picking team of from group of the recursion depth corresponds to the group membersthe node on the top row represents group member athe two nodes on the next row represent group member band so on if there are group membersyou'll have levels as you descend the tree you need to remember the sequence of members you visit here' how to do thatwhenever you make call to left termyou record the node you're leaving by adding its letter to sequence these left calls and the letters to add to the sequence are shown by the darker lines in the figure you'll need to role the sequence back up as you return to record all the combinationsyou can display them as you go along you don' display anything when making left calls howeverwhen you make calls to the rightyou check the sequenceif you're at valid nodeand adding one member will complete the teamthen add the node to the sequence and display the complete team summary recursive method calls itself repeatedlywith different argument values each time some value of its arguments causes recursive method to return without calling itself this is called the base case when the innermost instance of recursive method returnsthe process "unwindsby completing pending instances of the methodgoing from the latest back to the original call