3

1)-- Measurement: Draw a control flow graph for the given program and compute its cyclomatic complexity.

3. The Java program compress below takes two parameters: a string s and an integer factor, which indicates how many consecutive occurences of any character c should be compressed in the form on where n is the number of consecutive occurrences of c. The program compresses the input string s by the given compression factor and return the re- sulting compressed string. For example, given the input string "aabbb" and a factor 2, the resulting compressed string will be "a2b3", but it the factor is 3 instead, then the sequence of two a's is not compressed and the resulting string will be "aab3". 1 2. 3 4 5 6 7 8 9 10 11 12 13 14 15 public static String compress (String s, int factor) { if (factor =2"); if (s.length() factor) result += last + String.valueof (count); else result += current; last = c; current = String.valueOf(c); count = 1; ) } if (count >= factor) result += last + String.valueof (count); else result += current; return result; 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30