Consider the following tree for a prefix code: 1 y Figure 13: A tree with 5 vertices. The top verter branches into character, a, on the left, and a verter on the right. The verter in the second level branches into character, e, on the left, and a verter on the right. The verter in the third level branches into two vertices. The left verter in the fourth level branches into charac- ter, e, on the left, and character, n, on the right. The right verter in the fourth level branches into character, d, on the left, and character, y, on the right. The weight of each edge branching left from a verter is 0. The weight of each edge branching right from a vertex is 1. (a) Use the tree to encode “day". (b) Use the tree to encode "candy". (c) Use the tree to decode “1110101101". (d) Use the tree to decode “111001101110010",

Figure 14: A tree diagram has 9 vertices. The top vertex is d. Vertex d has three branches to vertices, f, b, and a. Vertex b branches to three vertices, i, h, and e. Vertex a branches to vertex c. Vertex c branches to vertex g.(a) Give the order in which the vertices of the tree are visited in a post-order traversal.(b) Give the order in which the vertices of the tree are visited in a pre-order traversal.