Answer:
Step-by-step explanation:
asjdyh aw8ehjw ashhh we8hdajs faedu wendlajsf a
<h3>
<u>Explanation</u></h3>

The vertex of Parabola is the maximum/minimum point depending on the value of a.
<u>h-value</u>

<u>k-value</u>

The minimum value is the value of k. Therefore the minimum value is - 49/4 at x = -5/2.
This is Calculus method. We simply differentiate the function then substitute y' = 0.

Substitute f'(x) = 0

Substitute x = -5/2 in the original equation.

<h3>
<u>Answer</u><u /></h3>
<u>
</u>
Answer:
The running time is quadratic (O(n²) )
Step-by-step explanation:
For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n), is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is
C + T(n) + n*(a*n+b) = an²+bn + T + C
Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).
Answer:
A. 45
Step-by-step explanation: