Big-O Coding Exercise Show your solution and explanations. Problem 6 def oneloop (n) : while n != 1: n = math.floor(n/2) print (n) For the following snippets of code perform the following Find the...

will give thumbs up

Python

Big-O Coding Exercise

Need solving and explanation

Pls answer only if u know big-o

Extracted text: Big-O Coding Exercise Show your solution and explanations. Problem 6 def oneloop (n) : while n != 1: n = math.floor(n/2) print (n) 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? In other words what is the complexity of this algorithm? Since n usually refers to input size you may assume it is a positive integer.