For the following linear search algorithm given below, do

a$)$ Draw the control flow graph and calculate Cyclomatic Complexity

b$)$ Identify all the Independent paths or basis set of all the execution paths.

algo linearSearch $($arr$,$ size, elem$)$

$\{$

int i$=0$;

int found $=0$;

while $(($i $<$ size$)$ or $(!$found$))$

$\{$

if $($elem $==$ arr$[$i$])$ found $=1$;

i$++$;

$\}$

if $($found $==$ true$)$

printf$($Element found at $\%$d$,$ i$)$;

else printf$($Element not found$)$;

return found;

$\}$

STRICT NOTE : ANSWERS PASTED WITHOUT EFFORT FROM CHATGPT$/$CLAUDE$/$GEMINI WILL BE DOWNVOTED