### Assignment Instructions/ Description

Solve the followingï¿½Image transcription textPerform the time analysis of the code and derive asymptotic order notation (ice., big-oh notation). It is the steps that

matter in the answer and you earn marks for it, simply mentioning big ch of the code will get only 1 mark. (write the

complexity of all instructions with line number given as L1, 12 and so on).

LI.

int count(int arr, int n)

12:

L3:

int i, sum = 0;

for (1 = 0; i < n; 1+2) <

sum = sum + arr[i];

return sum;

L8:... Show moreï¿½