as soon as posible

Question 5 (30p) Four algorithms are given below, where is the input size. Replace k mand p with the values in Question 1. Analyse (calculate the worst case time complexity of the algorithms and give your results in 66). k= 5 ms 4 ALGI (n) De 5 for it ton while (31) ALGR) while) L-1/ fort to print 30 ALGS) if return olsa return ALC3/3): ALCA) in return else return (ALG)