1. Draw the control flow graph that represents abstraction of its execution. Label edges and nodes in the graph with the corresponding code fragments. Do not forget to indicate initial and end node(s).
2. List the test requirements for Node Coverage
3. List the test requirements for Edge Coverage
4. List the test requirements for Edge-Pair Coverage
5. List all simple paths
6. List the prime paths
7. Extend the prime paths to create a set of test paths TR that provide Prime Path Coverage (PPC)

* Returns the frequency of each element in the specified integer array * E.g., source = [1, 2, 3, 1, 1, 0], result = {0=1, 1=3, 2-1, 3=1} * E.g., source = [1, 1, 9], result={1=2, 9=1} indicates 1 occurs twice and 9 occurs once * @param source integer array to use as a source of elements * @throws NullPointerException if source is null * @return HashMap that contains key value pairs */ private static HashMap countFrequency(int[] source) { if (source == null) { throw new NullPointerException(); } HashMap frequencyMap = new HashMap (); for (int i = 0; i