Java Code Project

You will write a class [login to view URL] that implements an interface [login to view URL], provided to you by the instructor. Download this interface and a short testing program from Canvas. Do your own testing to ensure correctness; do not rely on the provided test program to test every input possibility. YOU MUST SOLVE ALL OF THESE PROBLEMS RECURSIVELY. If you turn in a non-recursive solution for any problem, that problem will receive no credit. The following are the methods in the interface that your class must implement. public int sumTo(int max) Returns the sum of all numbers from 0 to the given maximum value, inclusive. For example, sumTo(5)returns 15 because 0 + 1 + 2 + 3 + 4 + 5 = 15. If sumTo is passed a negative number, it returns the sum from zero down to that number; public void printNumbers(int max) Prints a pattern of bracketed numbers, by powers of two down from the given max, in a mirrored pattern. If printNumbers is called with a max less than or equal to 0, it produces no output. printNumbers(0) prints printNumbers(1) prints [1] printNumbers(2) prints [1][2][1] printNumbers(3) prints [1][3][1] printNumbers(4) prints [1][2][1][4][1][2][1] printNumbers(8) prints [1][2][1][4][1][2][1][8][1][2][1][4][1][2][1] printNumbers(15) prints [1][3][1][7][1][3][1][15][1][3][1][7][1][3][1] public int toDecimal(String text) Assumes that the given text string represents a binary number, such as "1010010", and returns the int value that represents that binary number in base-10 (decimal). The empty string is assumed to have the value 0. For example: toDecimal("") returns 0 toDecimal("0") returns 0 toDecimal("1") returns 1 toDecimal("10") returns 2 toDecimal("11") returns 3 toDecimal("1000") returns 8 toDecimal("1011") returns 11 toDecimal("111000") returns 56 toDecimal("1010010") returns 82 public boolean phraseAnagramCheck(String s1, String s2) Returns true if s1 and s2 represent phrases that are anagrams of each other. Anagram phrases are strings that contain the same letters in the same multiplicities (counts). You should perform a case- insensitive comparison, ignoring differences in capitalization between s1 and s2; for example, "Acres" and "CARES" should be considered anagrams. You should also ignore spaces.  public void printZigZag(int size, int indent) Prints a zig-zag pattern of asterisk * characters, with the entire pattern indented by the given number of spaces. The pattern should draw horizontal lines of decreasing lengths, repeated in its top-left section and its bottom-right section. If the value of size is less than or equal to zero, or if the value of indent is negative, no output is produced. It's easier to show than it is to describe, so here are some example outputs: printZigZag(4, 0) prints: (output on next line) * ** * **** * ** * printZigZag(8, 0) prints: (output on next line) * ** * **** * ** * ******** * ** * **** * ** *  Expected output: sumTo 5: 15 sumTo -6: -21 [1] [1][2][1] [1][3][1] [1][2][1][4][1][2][1] [1][2][1][4][1][2][1][8][1][2][1][4][1][2][1] [1][3][1][7][1][3][1][15][1][3][1][7][1][3][1] [1][3][1][7][1][3][1][15][1][3][1][7][1][3][1][30][1][3][1][7][1][3][1][15][1][3][1][7][1][3][1] 0 0 1 2 3 8 11 56 82 true true false false false zigzag 1 * zigzag 2 * ** * zigzag 3 * *** * zigzag 4 * ** * **** * ** * zigzag 6 * *** * ****** * *** * zigzag 8 * ** * **** * ** * ******** * ** * **** * ** * zigzag 12 * *** * ****** * *** * ************ * *** * ****** * *** * zigzag 16 * ** * **** * ** * ******** * ** * **** * ** * **************** * ** * **** * ** * ******** * ** * **** * ** * zigzag 35 * ** * **** * ** * ******** * ** * **** * ** * ***************** * ** * **** * ** * ******** * ** * **** * ** * *********************************** * ** * **** * ** * ******** * ** * **** * ** * ***************** * ** * **** * ** * ******** * ** * **** * ** *