Q1. Apply the Quick sort algorithm for the given array of elements and sort the elements (Take the element 28 from the list as pivot element). As well describe the complexity of the algorithm for worst case and best case.

28, 32, 12, 5, 48, 13, 35, 11

Q2. prepare down an algorithm to merge the nodes of two AVL trees to get a new AVL tree. Illustrate the computing time of your algorithm.

Q3. prepare down a function to perform string copy and string compare operations given two strings stored in the array that are passed as arguments to the functions.

Q4. prepare pseudo-code to extract, insert and delete the characters in a string of characters stored in an array to describe manipulation of character data in arrays. Strings of characters are stored and processed in the arrays. Suppose appropriate start index and end index to describe the above operations.