The triangular numbers are as follows: 136 10 15 21 etc. || || || || || || 1 1 + 2 1+ 2+ 3 1+2+ 3+ 4 1+ 2+ 3+ 4 + 5 1 + 2+ 3+ 4+ 5+ 6 The series begins with 1 (the first triangular number). To calculate the nth triangular number, n is added to the previous triangular number. For example, the fourth triangular number is calculated by adding 4 to the third triangular number (which is 6), i.e. 10 = (1+2+3) + 4. Write a recursive function in that will calculate the nth triangular number. Note: will not receive any credit for a non-recursive solution. For example, the following statements would lead to the underlined output: Example 1: print (triNum(1)); 1 Example 2: print (triNum(2)); 3 Example 3: print (triNum( 5 )); 15 Note: you may assume the parameter will be positive - no error checking of inputs is required.