Below are the option to draw and upload your flow graph.

1) Draw the flow graph on plain paper, take a picture, and upload your picture in space provided.

2) List down ALL predicate node(s) found on your flow graph.

3) List down ALL expected independent paths on your flow graph.

4) Calculate the Cyclomatic Complexity V(G) for your flow graph.

Based on Figure 7, convert the flowchart given using representation as stated in Table 1 into flow graph and label All the possible region(s). Start Login No Authorized? -No Attempted 3 times? Yes Access granted Yes No Exit module? -Yes End Figure 7 Table 1 No. Label in Flowchart Label in Flow Graph 1 Start A 2 Login B 3 Authorized? C D 4 Attempted 3 times? 5 Access granted E 6 Exit module? F 7 End G