$1.$ Readthealgorithmgivenbelowandanswerthesequestions:

a$.$ b$.$ c$.$

What does this algorithm do$?$

Does this algorithm have cases and why?

Calculate the number of steps performed by the algorithm and determine the complexity of the algorithm

Statement S$/$e fori$1$to$10$ do

frequency

Total No$.$ of steps

Alg$\_2($n$)$

forj$1$ tondo

write $($i$,*,$ j$,=,$ i $*$ j$)$ Total number of steps

Complexity

$2.$ Compute the time complexity for the following algorithm

Algorithm s$/$e frequency

Total steps

Algorithm f$($n$,$ m$)$

$\{$

sum $0$

for i$1$ to n

for j$1$ to m

sum $$ sum$+($i$*$j$)$

return sum; $\}$

Total ComplexityAssignment No$.1$

Read the algorithm given below and answer these questions:

a$.$ What does this algorithm do$?$

b$.$ Does this algorithm have cases and why?

c$.$ Calculate the number of steps performed by the algorithm and determine the

complexity of the algorithm

Compute the time complexity for the following algorithm