Consider the pseudocode below (i.e. Pseudocode A, B, C). In each case 
complete the following:

a) Derive the program graph.
b) Determine the cyclomatic number.
c) List the set of independent paths given the cyclomatic number.
d) Derive a minimum test set for the pseudocode.

Pseudocode A:

This code fragment checks to see if an item is numeric or non-numeric.

   get item
   if item is numeric
       print 'NUMERIC'
       if item < 0
           print 'NEGATIVE'
       endif
   else
       print 'NON-NUMERIC'
   endif
   print item


Pseudocode B:

This code fragment iterates through lines in a file. Each line 
contains one or more numbers. The numbers on each line are added
together and the total printed. At the end it prints the number 
of lines in the file.

   countline = 0
   get first line in file
   do while file not empty
       countline = countline + 1
       total = 0 
       get first number on line 
       do while not end of line
           total = total + number
           get next number on line 
       enddo
       print total 
       if total > 1000000
           print 'BIG TOTAL'
       endif    
       get next line in file
   enddo
   print countline


Pseudocode C:

This code fragment either reads from a file or a list depending on the
setting of a flag and prints each retrieved item. 

   count = 0
   get flag
   if flag is FILE
       print 'FILE'
       get first item from file
       do while not end of file
           count = count + 1
           print item
           get next item from file
       enddo
   else    
       print 'LIST'
       get first item from list
       do while not end of list
           count = count + 1
           print item
           get next item from list
       enddo
   endif    
   print count