DATA STRUCTURE

Q3 [10 pts]. Write a recursive method to print a pattern without using any loop Given a number n, print following pattern without using any loop. Examples: Input: n 16 Output: 16,11, 6,1, -4, 1, 6,11, 16 Input: n 10 Output: 10, 5, 0, 5, 10 first reduce 5 one by one until you reach a negative or 0. After you reach 0 or negative, you add 5 until you reach n Q4 [5 pts] What is the output of the following code. Show all your work public class ConstructT public static void printT (intl] A) if (A.length 1) return; int[] temp new int[A.length - 1]; for (int i 0; i