A sequence is defined as follows. H(n) 5 if n 1; H(n) -H(n 1)+n+ 7ifn>1. Write a recursive method with signature "public static int Hint n)" that computes the n-th number of the sequence. 3. Write a recursive method with signature "public static int Sum(int n)" that computes the following sum 1*1 1 +2*2*2+.. + n*n*n. 4. Write a recursive method with signature "public static void Reverselint nl)" that displays the digits in a positive integer nl in reverse order. 5. Fill in the blanks in the following bubble sort programs in our lectures. public static void Swap(intl] array1, int i, int j) int temp - array1[il; array1[i] - arrayl0: array1 i] temp; public static void bubbleSort(intl] array) f for (int i - 0; ii++) for (int j-0;j if ( /Invoking Swap method defined above. 6. Fill in the blanks in the following recursive version of binary search program. Notice that the input data arranged in increasing order. public static int BinarySearch(int] array, int low, int high, int target) f if (low > high) return ; //blank 1 else int mid- ; //blank 2 if (array[mid] target) return ; //blank 3 else if (array[mid]