I need it's solution.

estron No. 1: a) 55 marks] While doing worst case analysis of an algorithm, I found it takes 22n steps to complete the job, where n is the input size. Can 1 say it is O(2m) ? Why or why not? b) 15 marks]Calculate the time complexity expression of the following code snippet with respect to n and then express it in terms of Big-Oh notation. Please show all working for full credit