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 $<mtext\; id="EditorElement\_2328181"></mtext><mn\; id="EditorElement\_2328182">0</mn><mi\; id="EditorElement\_2328183">)</mi>$ return $-1$; if$($num$\_$B $<mtext\; id="EditorElement\_2328225"></mtext><mn\; id="EditorElement\_2328226">0</mn><mi\; id="EditorElement\_2328227">)</mi>$ return $-1$; if$($num$\_$A $+$ num$\_$B $==0)$ return $-1$; tot$\_$cost $+=$ num$\_$A $*40$; tot$\_$cost $+=$ num$\_$B $*70$; if$($tot$\_$cost $<mtext\; id="EditorElement\_2328385"></mtext><mn\; id="EditorElement\_2328386">2</mn><mn\; id="EditorElement\_2328387">0</mn><mn\; id="EditorElement\_2328388">0</mn><mi\; id="EditorElement\_2328389">)</mi>$ tot$\_$cost $+=10$; return tot$\_$cost; $\}\}$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.For each test case, you must provide the input values and the output value in addition to the covered path. The method has two integer parameters: num$\_$A and num$\_$B$.$ The method returns the total cost with shipping.

$$ I want control flow graph

$$and calculate cyclomatic complexity and develope test cases

$$ and part b and c Which is given above