f index $=-1$; start$=0$; while$(($start$<=$end$)$ && $!$found$)//3-$set mid to $($start$+$end$)/2//5-$ set found to TRUE $//7-$otherwise if $[$target data $>$ n$[$mid$]$ then e$1$se $1\}$ int main$()$ lint item $=64,$ searchingData$1,$ searchingData$2$;$//10-$searchingData$2=$ function calling to searching$2()$ function$\}$Figure Q$4$ a$)$ Write the code segments of the algorithm for searching$1()$ function in the comment section labelled from $1$ to $2$ in C programming. $(3$ marks$)$ b$)$ Write the code segments of the algorithm for searching$2()$ function in the comment section labelled from $3$ to $8$ in C programming. $(6$