Show that the running time of the merge-sort algorithm on n-elementsequence iso(nlogn)even when n is not a power of 2.

The table below represents a linear function f(x) and the equation represents a function g(x): x f(x) −1 −5 0 −1 1 3 g(x) g(x) = 2x − 7 part a: write a sentence to compare the slope of the two functions and show the steps you used to determine the slope of f(x) and g(x). (6 points) part b: which function has a greater y-intercept? justify your answer. (4 points)

You eat 8 strawberries and your friend eats 12 strawberries from a bowl. there are 20 strawberries left. which equation and solution give the original number of strawberries?

Plz a. s. a. p.the table shows the number of male and female contestants who did not win a prize. what is the probability that a randomly selected contestant won a prize, given that the contestant was female? write the probability as a percent. round to the neares tenth, if needed.