Based on the graph below, draw the minimum spanning tree using Kruskal's and Prim's Algorithm. 3 10 7 4 E 3 5 M 9 Problem Set 13E (15 pts. each.) Given the table below an information regarding string that can send on the network. Use Huffman coding algorithm to compress the total number of bits. Show your solution including the Huffman code tree. Character Code Frequency Total bits B 000 10 30 S 001 15 45 U 010 12 36 011 3 12 100 4 12 E 101 13 39 New line ( ) 110 1 3 Problem Set 13A (10 pts) Draw the unique binary tree when the inorder and preorder traversal is given as follows: INORDER: B, A, D, C, F, E, J, H, K, G, L PREORDER: A, B, C, D, E, F, G, H, J, K, L Problem Set 13B (10 pts.) Draw the unique binary tree when the inorder and postorder traversal is given as follows: INORDER: 3, 2, 5, 4, 1, 7, 6, 9, 10, 8, 11 POSTORDER: 3, 5, 4, 2, 7, 10, 9, 11, 8, 6, 1 Problem Set 13C (3 pts. each) A graph with 5 vertices a, b, c, d, e has the following adjacency list: a: b, e b: a, c, d, e c: b, d d: b, c, e e: a, b, d A. draw this graph B. draw 3 spanning tree that is a path graph C. draw possible non-isomorphic tree