Draw the appropriate control flow graph for each of the given pseudocodes. Remember control flow graphs show the structure$/$architecture $($all the legitimate ways the code can execute$)$ but not any specific path through $($i$.$e$.$ it is not a test case and doesn$$t use actual values for the variables$).$ Question $3$:

$\backslash$table$[[$Line #$,$Code$],[,//$See if n is prime$],[,$n$=2],[,$while $($nisPrime$=$True$],[,$x$=2],[,$while $($x

Make sure to only use one number for blocks of code which are all sequential and when the first line is executed, all of those lines are executed.$$ Remember to number the lines of code first. Each question is independent from the other ones. Note: $//$ represents a comment

$\{\}$ show what is included for a specific condition. Otherwise, use indenting $($how Python works$)$