$($a$)$ Draw the ordered rooted tree whose pre$-$order traversal is

$a,b,e,j,k,n,o,p,f,c,d,g,l,m,h,i$

What is its post$-$order traversal?

$\%$

$($b$)$ Using Kruskal's algorithm, find a minimum spanning tree in the weighted

graph whose vertices are $A,B,C,D,L,M,N,S$ and the edges are

$\{S,L\},\{S,D\},\{S,C\},\{S,N\},\{L,D\},\{L,N\},\{C,B\}$

$\{C,N\},\{C,A\},\{A,N\},\{A,M\},\{N,B\},\{D,C\},\{N,M\}$

with corresponding weights

$349,957,1855,2534,834,2451,860,722,606,760,595,191,908,1090$