5. consider the problem of finding the longest monotone increasing (nondecreasing) subsequence from a given sequence of length n. search the web for an o(nlgn)-time algorithm. carefully trace this sub-quadratic algorithm on the following sequence below. (10 points) (4, 1, 3, 8, 6, 2, 0,-5, 8, 2,7,41, -4, -7, 8, 4, 11, 13,7, 9, 10)

Kevin has just finished paying off his loan. he was assessed a service charge of $422. he paid off the principal and the interest by making weekly payments of $36.13 for four years. if the principal was $7,150, how much did kevin pay in finance charges, to the nearest dollar? a. $498 b. $365 c. $422 d. $787

This is so hard and it’s for a test

Amachine that produces a special type of transistor (a component of computers) has a 2% defective rate. the production is considered a random process where each transistor is independent of the others. (a) what is the probability that the 10th transistor produced is the first with a defect? (b) what is the probability that the machine produces no defective transistors in a batch of 100? (c) on average, how many transistors would you expect to be produced before the first with a defect? what is the standard deviation? (d) another machine that also produces transistors has a 5% defective rate where each transistor is produced independent of the others. on average how many transistors would you expect to be produced with this machine before the first with a defect? what is the standard deviation? (e) based on your answers to parts (c) and (d), how does increasing the probability of an event a↵ect the mean and standard deviation of the wait time until success?