Analyze AlgorithmTwoPowers(y, z) (yandzare nonnegative integers): Determine theasymptotic lower and higher bound for itsworst-casetime complexity. Make your bounds as tight aspossible. Justify your answer.

Question 5 spring semester final exam math evaluate

Four airplanes carrying a total of 400 passengersarrive at the detroit airport. the airplanes carry, respectively,50, 80, 110, and 160 passengers.a) one of the 400 passengers is selected uniformly at random.let x denote the number of passengers that were on theairplane carrying the randomly selected passenger. find var(x)for x as given in the problemb) one of the 4 airplane drivers is also selected uniformly atrandom. let y denote the number of passengers on the chosen driver’s airplane. find var(y) for y as given in the problem

Factor k2 - 17k + 16. a.(k - 2)(k - 8) b.(k - 1)(k + 16) c.(k - 1)(k - 16)