(Solved): Question 9. Convert the following graph to adjacency matrix and adjacency list (linked list) Questi ...

Question 9. Convert the following graph to adjacency matrix and adjacency list (linked list) Question 10. (a) Construct the binary tree from the following inorder and preorder traversal Inorder: $40,20,50,10,60,30$ Preorder: $10,20,40,50,30,60$ (b) Construct a binary tree from post order and inorder Post order: $9,1,2,12,7,5,3,11,4,8$ Inorder: $9,5,1,7,2,12,8,4,3,11$ Question 11. Find the minimum spanning tree of the following graph Question 12. Draw the state table of the following finite state automaton and infer what kind of language is accepted by the automaton and what kind of string it rejects. q0, q1 and $q_3$ are the states and $?=\left\{{\mathrm{a}}_{\mathrm{a}}\mathrm{b}\right\}$ and ${\mathrm{q}}_0$ is the final state Question 13. (a) In how many ways can 12 examinations be arranged so that the best and the worst paper may never come together. (b) Of the 14 articles, 10 are of same type and each of the remaining is of different type. Find the number of combinations if 10 articles are taken at a time.