I need solve this questions please

1. Perform the selection sort on the given array. Show the content of the array after each pass, until sorted. 2. Perform the bubble sort on the given array. Show the content of the array after each pass, until sorted. 3. Compute the edge list and vertex list of the following graph. 4. Consider the given tree and enlist the followin: a. Internal Nodes b. External Nodes c. Ancestors of node J d. Descendants of node C e. Height of node C f. Degree of node D 5. Given the following List Representation, construct the tree. (A (B (E (K, L), F), C ( G ), D ( H (M), I, J ) ) ) 6. Represent the following tree using: a. List Representation b. Left Child, Right Sibling Represent 7. Consider the following trees, and give the three different types of traversals for each. Inorder: Preorder: Postorder: Inorder: Preorder: Postorder: 8. For the given graph, find the shortest path from the origin node (a) to all nodes: 9. Design an arithmetic expression tree for the given expression: (y(a+b)(cd)) 10. What is the number of nodes in a perfect full binary tree of height 4 ? 11. Evaluate the given postfix expression using stack. 6523+8+3+ 12. There are 8 elements Hash Table that result from using the hash function, h(k)=k2mod7 Assuming the keys are 21,5,7,15,17,25 and 35 Draw those 8 elements in the Hash Table after the results from using the hash function and handle the collisions by a. Separate chaining. b. Open addressing (using Linear Probing; f(i) is a linear function of i{0,1,2,}) 13. Implement linear and binary search on the following data