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)

hey there!

if she's saving for six months, let's divide the total number we need for the trip by six, dividing it into the amount that needs to be saved for each month.

500 ÷ 6 =

she needs to save at least this amount each month, so we should use this symbol: ≥

let x be the amount she saves each month.

your final answer is x ≥

hope this !

median is the value separating the higher half of a data sample, a population or probablity distribution from the lower half.

step-by-step explanation:

say you have 3,8,7,3,1,9,8 order them from lowest to highest

if orderd it would be 1,3,3,7,8,8,9 now you take away from the lowest and the highest until you end up in the middle.

so you would remove the 1 and 9 leaving you with 5 digits remaining

when you've reached the middle that would be your answer so in this case the answer is 7

if there were two numbers left say 7 and 5 you'd and them together so 12 then divide by 2 witch would equal 6 so the answer would be 6

good luck on that project hoped i you at all

all you have to do is multiply them both to see how many out comes you can put:

3 x 2 = 6

you can make 6 diferent combinations of crusts and toppings.

~batmans wife dun dun