A sequence is defined as follows. H(n) = 3 if n = 1; H(n) = H(n -1) + n + 1 if n > 1. Write a recursive method with signature "public static int H(int n)" that computes the n-th number of the sequence. Write a recursive method with signature "public static int Sum(int n)" that computes the following sum 1*1 + 2*2 + ellipsis + n*n. Write a recursive method with signature "public static void Reverse(int n1)" that displays the digits in a positive integer n1 in reverse order