i$.$ Find total cost of the algorithm in terms of cost of each line $(c$ where $1i6)$ and how

many times each line is executed, in worst case.

many times each line $is$ executed, $in$ worst case $=C_1+C_{2}n+C_3(n-1)+C_4(n-1)+C_5+C_6$

$=(C_2+C_3+C_4)n+C_1-C_3-C_4+C_5+C_6$

ii$.$ What is the order of time complexity of the algorithm $?$

$(n)$