/** * Count positive elements * * @param x array to search * @return count of positive elements in x * @throws NullPointerException if x is null */ 

public 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];Expcted=2 // Book website: CountPositive.java // Book website: CountPositiveTest.java

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

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

3. (c) 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. (d) If possible give a test case that results in an error state, but not a failure. Hint: Dont forget about the program counter. If not, briefly explain why not.

5. (e) For the given test case, describe the first error state. Be sure to describe the complete state.