Problem $1(5$ marks$).$ Calculate the number of elementary operations in the average case for the

following algorithm $($justify your answer$).$ You only need to count operations stated explicitly as

$$C elementary operations$,$ and you may ignore arithmetic operations, comparisons, etc. You may

assume that each element of a is either $0$ or $1,$ chosen uniformly.

$1$ a $$ list of n elements

$2$ Function eastylat$($a$)$:

$3$ s $0$

$4$ for i $1$ to n do

$5$ s $$ s $+$ a$[$i$]$

$6$ C elementary operations

$7$ for i $1$ to s do

$8$ C elementary operations

$2$