Determine the frequency counts for all statements in the following two algorithmsegments and calculate complexity assuming that i^th statement will take ci (constant)amount of time to execute.1. for i=1 to n do1. i=0;2. for j = 1 to i do2. while (i <= n) do3. for k = 1 to j do3. x = x 1;4. x = x 1;4. i=i 1;

Describe cycle counting. On what basis can the count frequency ... | Filo