III. Please identify the test cases for the following code segment using basis path testing: $(30$pts$)$

Procedure SaleSalary $($n: integer, key, task : array$[1..$n$]$ of integer, name: array$[1..$n$]$ of string, level : integer, personname: string$)$

var $j,$ salary: double; promotion : double begin

salary :$=0$;

$i$:$=0$;

personname :$=$ null;

for $j$:$=1$ to $n$ do

if $)=(task[j]$ then salary :$=$ salary $+100$

promotion :$=$ salary $*$ task $/$ key;

endif

if $($promotion $<mn>0</mn><mn>.</mn><mn>2</mn><mtext></mtext><mi>)</mi>$ then level :$=0$

else if $($promotion $0\mathrm{.}2$ & & promotion $<mn>0</mn><mn>.</mn><mn>4</mn><mtext></mtext><mi>)</mi>$ then level :$=1$; task :$=1$;

else if $($promotion $0\mathrm{.}4$&& promotion $<mn>0</mn><mn>.</mn><mn>6</mn><mtext></mtext><mi>)</mi>$ then level :$=2$; task :$=2$;

else level :$=3$; task :$=3$;

endif

update personname;

key$++$;

endfor

end

You need to follow the following steps:

Develop the control flow graph for the above pseudo code $(10$pts$)$

Calculate the cyclomatic complexity correctly $(8$pts$)$

Identify all independent paths correspondingly $(12$pts$)$