NOTE: This is a multi$-$part question. Once an answer is submitted, you will be unable to return to this part.

Give a big$-$O estimate for each of these functions. For the function $g$ in your estimate that $f(x)$ is $O(g(x)),$ use a simple function $g$ of the smallest order.

Ch $03$Sec$2$ Ex $27($b$)-$ Big O Estimates

$(nlogn+1{)}^2+(logn+1)(n^2+1)$ is $,.$

Multiple Choice

$nlog(n^2)$

$n^2(logn{)}^2$

$nlogn$

$n^{2}logn$

Suppose that an element is known to be among the first four elements in a list of $32$ elements that are ordered increasingly. Would a linear search or a binary search locate this element quickly?

Multiple Choice

binary search

both linear and binary searches take the same amount of time.

neither linear search nor binary search

linear search

Suppose that an element is known to be among the first four elements in a list of $32$ elements that are ordered increasingly. Would a linear search or a binary search locate this element quickly?

Multiple Choice

binary search

both linear and binary searches take the same amount of time.

neither linear search nor binary search

linea