Show detailed explanation especially for part 2. Thank you very much.

Part 1 For the following snippets of code perform the following Find the function for the number of steps the algorithm performs. To what Big-O set will this algorithm belong to (i.e. What is the complexity of this algorithm.)? Since n usually refers to input size you may assume it is a positive integer. Problem 2 edef looping (n): m = n m = m*10 for i in range (m/2): print (n) Problem 6 def dividing (n): while n!= 1: n = math.floor (n/2) return True Part 2 Problem 7 Show that a function y = n^2 can not belong to the set O(1) using the formal definition of Big-o