Consider the following algorithm For i epsilon 1 2 3 4 5 do

Consider the following algorithm. For i epsilon {1, 2, 3, 4, 5} do beep for j epsilon {1, 2, 3, 4} do beep for k epsilon {1, 2, 3} do for/epsilon {1, 2, 3, 4} do beep for m epsilon {1, 2, 3, 4, 5, 6} do beep How many times does a beep statement get executed?

Solution

total number of time the word beep gets executed is = 5 + 5*4 + 5*3*(4+6)
                                                    = 5[1 + 4 + 3*10]
                                                    = 5*[35] = 175