1. Construct a flow graph for the code. You may do this in any way that allows you to send it to me in digital format. You can create the graph using Visio, Word, or some other application. You can also draw it on paper and scan it in – just make sure it’s clearly readable.2. From your flow graph, calculate the cyclomatic complexity, V(G), using all three of the methods discussed in class. All three calculations should agree with each other.The code is written in Java, so you are all probably familiar with the syntax to some extent. In the event you are unable to follow the syntax, please let me know. You needn’t be concerned with what the code itself is supposed to do.
