Big Oh notation questions. Just need help identifying which are being used based upon the code. I tried Algorithim1 on my own. A simple explanation explaining why would be belpful for these few as well. Thank you I would appreciate this and make sure to thumbs up :)

Try it out Analyze the algorithms provided below. Identify the asymptotic running time of the code provided below using Big Oh notation. Algorithml (n) 1: Initialize i, j, sum = 0 2: for (i = 0; i 0) do 3: y+v/2 5: end while 6: return x 4: Asymptotic Runtime: Justify the running time by explaining why? in the space provided below. Algorithm4 (n) 1: Initialize I, y, sum = 0 2: for (r = n/2; x 0) do j = j-1 5: 6: end while 7: end for 8: 9: end for 10: return sum Asymptotic Runtime: Justify the running time by explaining why? in the space provided below