I needhelp doing these

Order the following functions for Big-O from fastest to slowest. Write the labels a, b, c, d, e instead of the actual functions in the answer. b a. n b. log n c. 2^n d. n^5 e. n log nGiven a class defined as follows: class Coffee: def __init__(self, t, p): self . type = t self . price = p Suppose the type of a Coffee object is represented as a string, and the price is a floating number. Write a single Python statement that creates a Coffee object named myCoffee with type "Dark" and price 5.3. [ans]Given input plist = [25, 60, 80, 3, 82] for the bubble sort, by the end of the 2nd iteration of the outer for loop, plist becomes: plist = [ UUse mergesort to sort the list [10, 40, 5, 2, 11]. Show your work. You may describe the steps in words or draw a picture as we did in class. HTML Editor U A . A E X ED VX V D - To 12pt ParagraphCalculate the T(n) of the following function, making sure not to discard constants or low-order terms yet (you may or may not count the counting variable in a for loop). Then Given what you think is the Big-O performance for the function. Prove that your proposed Big-O for the function is correct (make sure to show your work). def fun(n): X = 0 for i in range(n): X=x+1 while x > 0: X -= 1 n = = 1 return n HTML Editormun A A ED: IN VX V AT 1 12pt ParagraphSuppose an algorithm solves a problem of input size n in at most number of steps T(n) = 5n + 2n' + nlogn. Calculate the Big-O (not just Big-O) for T(n). Show your work. HTML Editor on I A A E E EDE VX V AT TO 12pt Paragraph