Consider the following multiplication problem: Given an integer list (an array) of size n, we want to calculate the product of all numbers in the list and display the result. (a) Define an instance of a problem in general. (b) Specify two different instances of the multiplication problem defined above. (c) What is the solution for each instance in part (b). How did you come up with that solution?

Subj:- Design & Anal Algorithms Please compelete all the three questions since it has to be answereda once. Thank you in advance. Three animals stand next to each other by size, as follows: An Elephant, followed by a Hippo, followed by a Panda bear, [E, H, P]. Your goal is to re-arrange them so that they are sorted in the opposite size-based order. You are only allowed to switch positions of neighboring animals. Do not use Insertion or Merge sort. Try to use your own strategy to re-arrange the array. (a) How many operations do you need to reverse the order of the three animals? (b) Let’s generalize the above. You have an array of n elements whose ordering you want to revers. Write pseudo code to do this. (c) How many operations do you need to reverse the ordering of an array of n? Your answer should be a function of n.

Analyze the otherSort sorting function. What is its time- complexity in terms of the size of the input array it sorts if the array is in random, unsorted order? T *otherSort(T *arr, int N) { for (int idxUnsorted = 1; idxUnsorted 0) && (arr[idxCursor T cur = 1] > cur)) { arr[idxCursor 1]; arr[idxCursor] idxCursor--; arr[idxCursor] = cur; return arr; O (log n) 0 0 (n²) O (n!) O (n)

algorithm for finding all occurrences of a sequence in another sequence using the suffix array of the latter sequence can also be implemented in R in a straightforward way?

Write two different algorithms for AVL tree-based sorting, and explain what are their time complexities, respectively. Note: think about AVL tree-based PQ-sorting and AVL tree traversal for sorting. Algorithms should be written use pseudo-code? PLease write an algorithms not thery

Illustrate how algorithms make ARRAY the appropriate choice for some specific applications.

What are the practical considerations when you are analyzing the performance of differnt sorting algorithms? Assuming C language

1. Suppose you have these inputs: M, I, T, Q, L, H, R, E, K, P, C, A. a. Show the binary search tree for these inputs. b. Show how to store the binary search tree in an array with the node structure (key, left, right).

A decision tree for sorting problem is able to show all permutations ( possible outputs) of input array at its                           a. root b. internal node  c. Leaves  d. edges