harry knows the th triangular number is plus the th triangular numberso he calls sally and asks her to find the th triangular number this process continues with each person passing the buck to another one where does this buck-passing endsomeone at some point must be able to figure out an answer that doesn' involve asking another person to help if this didn' happenthere would be an infinite chain of people asking other people questions-- sort of arithmetic ponzi scheme that would never end in the case of triangle()this would mean the method calling itself over and over in an infinite series that would eventually crash the program the buck stops here to prevent an infinite regressthe person who is asked to find the first triangular number of the serieswhen is must knowwithout asking anyone elsethat the answer is there are no smaller numbers to ask anyone aboutthere' nothing left to add to anything elseso the buck stops there we can express this by adding condition to the triangle(methodint triangle(int nif( == return else returnn triangle( - )the condition that leads to recursive method returning without making another recursive call is referred to as the base case it' critical that every recursive method have base case to prevent infinite recursion and the consequent demise of the program the triangle java program does recursion actually workif you run the triangle java programyou'll see that it does enter value for the term numbernand the program will display the value of the corresponding triangular number listing shows the triangle java program listing the triangle java program /triangle java /evaluates triangular numbers /to run this programc>java triangleapp import java io */for / ///////////////////////////////////////////////////////////////