Question 4 - Coin fipping (20%5) Suppose there ture n coins labeled from 1 to n. Initially, all coins are tail: Then, we apply the following iterative procedure: - There are a total of n iterations: \{iteration 1 , iteration 2, .. iteration n \}. - In Iteration 1, any coin j is flipped if j is divisible by i. 1 Answer the following two questions. (a) [10\%] Determine the time complexity of the procedure in Bis O and lint. You may we the following inequality when answening this question. 1n+1x1dx