please answer all the questions and through the point. no explanation needed

$1.$ When we evaluate a general polynomial, do we have multiple ways to evaluate it$?$

Group of answer choices

yes

no

$2.$ Since the linear search is too slow, it is basically useless to solve any real$-$world problem.

Group of answer choices

True

False

$3.$ Given an array with $200$ elements, we want to do the linear search on this array. It is known that the probability of a key to be appeared in this array is $0\mathrm{.}6.$ What is the average number of comparisons to get the search result?

$4.$ When we apply the linear search on a given array, which of the following types of arrays do we expect to work on$?$

Group of answer choices

an unordered array

an ordered array

$5.$ We have an optimal algorithm that solves the Finding the minimum problem for a given array.

Group of answer choices

True

False

$6.$ When we evaluate a monomial xn$,$ we can apply the repeated squaring method and the repeated cubing method. We say that the repeated squaring method can never do worse than the repeated cubing method.

Group of answer choices

True

False

$7.$ Is it possible that one can find a special polynomial with n terms, such that the value of this polynomial can be calculated with less than $1\%$n multiplications?

Group of answer choices

yes

no

$8.$ When we talk about the data size concept, we always mean that it refers to the number of elements in an array.

Group of answer choices

True

False

$9.$ Given an array with n elements, is it possible that one can design an algorithm, so that this algorithm can find the minimum of this array with n$-2$ comparisons all the time?

Group of answer choices

yes

no