package sample;import java.util.Scanner;public class CostCalculator $\{$ public static void main$($String args$[])\{$ System.out.print$("$Please enter the number of A items: $")$; Scanner s $=$ new Scanner$($System$.$in$)$; int num$\_$A $=$ s$.$nextInt$()$; System.out.print$("$Please enter the number of B items: $")$; int num$\_$B $=$ s$.$nextInt$()$; System.out.println$("$Total cost with shipping: $"+$ total$\_$cost$\_$with$\_$shipping$($num$\_$A$,$num$\_$B$))$; $\}$ public static int total$\_$cost$\_$with$\_$shipping$($int num$\_$A$,$ int num$\_$B$)\{$ int tot$\_$cost$=0$; if$($num$\_$A $<0)$ return $-1$; if$($num$\_$B $<0)$ return $-1$; if$($num$\_$A $+$ num$\_$B $==0)$ return $-1$; tot$\_$cost $+=$ num$\_$A $*40$; tot$\_$cost $+=$ num$\_$B $*70$; if$($tot$\_$cost $<200)$

tot$\_$cost $+=10$; return tot$\_$cost; $\}\}$

a$.$ Draw a control flow graph for the program and clearly label each node to show its correspondence to a statement

$.$b$.$ Calculate the programs cyclomatic complexity. What does this mean in terms of the number of test cases to cover the code with respect to its branches?

c$.$ Develop a set of test cases to achieve full path coverage.