Answer the following question and show how to do

1. Which best describes an algorithm a) Sequence of steps for solving a problem b) Search engine c) Logarithm d) Application e) C++ program 2. log n! has order a) log n b) n c) n logn d) n e) n! 3. The worst-case complexity for the right-to-left binary method of computing powers in terms of the number n of binary digits where the basic operation is multiplication is a) logan b) 2n - 2 c) 3n-2 d) nlogen 4. The sequence of computation involved in the left-right binary method for 57 is a) X X? x? X14 X2 X57 b) X X X X3 X2 57 c) XX-X14X57 d) x + x - x - x -X16X12X57 e) XX-XXX-X57 5. An efficient algorithm for computing the greatest common divisor of two integers is: a) DFS b) Horner's rule c) FFT d) Euclid's Algorithm e) Kruskal's Algorithm 6. An efficient algorithm for polynomial evaluation is: a) DFS b) Horner's rule c) FFT d) Euclid's algorithm e) Kruskal's algorithm