Consider the following algorithm

Plz solve correctly and do not copy paste incorrect solutions.

1. count 0 2. kn 3. while k>1 4. for jk to n 5. count count +1 6. end for 7. kk/2 8. end while a) How many times step 5 is executed? (You must show your steps) b) What is the time complexity of the algorithm in -notation