2. What is the big-O of the following functions: (1) 40n5 + 2000n? + 1007 (ii) nlog n? + 99 nlogn + logn (i) 22log°n+ 12log n? + log(10000+n)

PLEASE ANSWER QUICKLYSuppose you've written a function called mystery, which takes in a list of integers. You know that when you run the function with a list of 1000 elements, it always takes roughly 2 minutes to complete.

What is the dominate term of each function? 3n?+4n-3 7n? + 4n² -7n + 5 Snlog(n) + 2n4

Please help I need help making this function bool power_of_two( unsigned n) and I dont understand it

Exercise: List the following functions by increasing order of growth. Here are the functions: f.(n) = n" f2(n) = n" f3(n) = (;) f4(n) = V2vn fs(n) = („",) fo(n) = 20ogn)* f;(n) = n5(log n)² f3 (n) = n* (")

this is a data structure question read the question carefully and answer it but dont plagarize from internet

Correct and detailed answer will be Upvoted else downvoted. Thank you!

implement greatestBitPos function Compute a mask marking the most significant 1 bit.   you are only allowed to use the following eight operators: ! ~ & ^ | + << >>   “Max ops” field gives the maximum number of operators you are allowed to use to implement each function   /* * greatestBitPos - return a mask that marks the position of the* most significant 1 bit. If x == 0, return 0* Example: greatestBitPos(96) = 0x40* Legal ops: ! ~ & ^ | + << >>* Max ops: 70* Rating: 4 */int greatestBitPos(int x) {return 2;}

Using Python