Hello I need help answering these 10 questions on Algorithms:

Please read carefully and give a proper response and answer all 10 questions. Thank you.

In the Polynomial Evaluation Problem, which of the following types of operations is the basic operation? addition multiplication assignment comparison Question 2 4 pts In the bubble sort, which of the following types of operations is the basic operation? comparison swap assignment addition When we calculate the limit of the ratio of two growth functions, we can always apply the l'Hospital's rule. True False Question 4 4 pts What is the growth function of the running time efficiency function for the bubble sort? n nlogn logn n2 (meaning n square) If a given array does not contain any adjacent inversion, then all the elements in this array must be in place. True False Question 6 4 pts Suppose an n-element array with n>2 is unordered. What is the minimum number of inversions in this array? When you solve the Element Uniqueness Problem, does there exist an algorithm whose growth function has lower order of growth than that of n2 ? yes no Question 8 4 pts Given an array with these four elements: 4, 2, 3, 1, how many inversions can you find in this array? When we solve the String Matching Problem, suppose there are n characters for the text and m characters for the pattern with n>m. How many m-substrings can you find in the given text? nmnm1nnnm+1 Question 10 4 pts An efficient algorithm does not have to perform well for the relatively small problem sizes. True False