3 E f Find a minimum spanning tree for the following graph where the degree of each vertex in the spanning tree does not exceed 2. Find all possible spanning trees with the least total weights. 2 Given the following coding scheme: A:001, B:0001, E:1, 1:110, R:0000, S:0100, T:011, X:0101 (10 points). a. Construct the binary tree with prefix codes representing the coding scheme above. b. Find the word represented by 010010111. 2 2 1 c b 1 2 3 d 2