1. countPositive method

1. Explain what is wrong with the given code. Describe the fault precisely by proposing a modification to the code.

2. If possible, give a test case that does not execute the fault. If not, briefly explain why not.

3. If possible, give a test case that executes the fault, but does not result in an error state. If not, briefly explain why not.

4. If possible give a test case that results in an error, but not a failure. If not, briefly explain why not. Hint: Dont forget about the program counter.

5. For the given test case below, describe the first error state. Be sure to describe the complete state. Hint: Dont forget about the program counter.

x = [-4, 2, 0, 2]; Expected = 2

6. Implement your repair and verify that the given test now produces the expected output. Submit a screenshot demonstrating your new program works.

/** * Counts positive elements in array * * @param x array to search * @return number of positive elements in x * @throws NullPointerException if x is null */ private static int countPositive (int[] x) { int count = 0; for (int i = 0; i < x.length; i++) { if (x[i] >= 0) { count++; } } return count; } // test: x = [-4, 2, 0, 2]; Expected = 2