a) Either draw a full m-ary tree with 24 leaves and height 3, where m is a positive integer or show that no such tree exists.

b) The word WONDER is resulted from pre-order traversal of a rooted binary tree.

i. Draw the tree with height of 2 that can represent the above traversal.

ii. Using tree in (i) find the word resulted from the in-order traversal.

c) Draw two spanning trees from the graph in Figure 3.

d) Data Communication company has offices A, B, C, D, E, F, G, H, and I. Table 1 shows the cost, in Ringgit Malaysia (RM), of transmitting a piece of information from one of the offices to another along all existing direct links.

i. Construct a network using vertices A to I to represent the information in Table 1.

ii. A piece of information has to be passed from office A to all the other offices, either directly or by being passed on from office to office. Use Kruskals algorithm to find the minimum total cost of passing the information to all the offices.

iii. Draw a network that produces the minimum total cost in (ii).

M W X Y Z V V U To A B C D E F GH I From A 4 8 B 4 8 11 8 7 4 2 D 7 9 14 E 9 10 F 4 14 10 2 G 2 1 6 H 8 11 1 7 I 2 6 7