1. Given the following method in Java, which finds the maximum value in an array of integers. public static int maximumValue(intl a) ( if (a != null && a.length > 0) { int max- a[0]; for (inti-; i a.length; i++) if (all> max) max = a[i]; return max; return Integer.MIN_VALUE; a) Design a test suite with the fewest number of test cases that satisfies the statement test criterion. Define the test suite as one or more literal arrays: T1 (a, b,. where the values in the array are actual integer values. I can be used to indicate an empty array, and the word 'null' by itself (not inside brackets) can also be used b) Design a test suite with the fewest number of test cases that satisfies the branch-condition test criterion. Define this test suite using the same technique as above 1. Given the following method in Java, which finds the maximum value in an array of integers. public static int maximumValue(intl a) ( if (a != null && a.length > 0) { int max- a[0]; for (inti-; i a.length; i++) if (all> max) max = a[i]; return max; return Integer.MIN_VALUE; a) Design a test suite with the fewest number of test cases that satisfies the statement test criterion. Define the test suite as one or more literal arrays: T1 (a, b,. where the values in the array are actual integer values. I can be used to indicate an empty array, and the word 'null' by itself (not inside brackets) can also be used b) Design a test suite with the fewest number of test cases that satisfies the branch-condition test criterion. Define this test suite using the same technique as above