4. (27%) Cyclomatic Complexity (from pages 521-529 and path coverage. Consider Figure 12.27 on page 472of textbook, reproduced here. (a) (5%) Convert this flow chart to a graph with nodes (vertices) and edges (links). Label every node and every link with numbers (b) (5%) Compute the path coverage and cyclomatic complexity for this graph (c) (5%) Can you modify this graph to have a connected graphs (p-1) G of cyclomatic complexity v (G) with v(G)-6 (modification consists of adding /removing lines, adding /removing nodes with all associated lines. (d) (4%) Remember that v(G) is the number of faces of a graph. Construct a (flow chart ) graph with v(G) 2 or state that such graph does not exist. (e) (4%) Construct a (flowchart ) graph with v(G)-1 or state that such graph does not exist. (f) (4%) Construct a (flowchart ) graph with v(G)-0 or state that such graph does not exist