Consider the following pre-order and post-order traversals of a cartesian tree. What would be the in-order traversal of that tree? Pre-order traversal: 96, 85, 69, 58, 36, 25, 14, 52, 47, 74, 41, 63 Post-order traversal: 25, 36, 14, 58, 47, 52, 69, 41, 74, 85, 63, 96 (a) 14, 36, 47, 58, 69, 85, 25, 41, 52, 69, 74, 63 (b) 36, 25, 58, 14, 69, 47, 52, 85, 41, 74, 96, 63 (c) 14, 25, 36, 41, 47, 52, 58, 63, 69, 74, 85, 96 (d) 36, 58, 69, 52, 41, 74, 96, 25, 14, 47, 85, 63

Let Tsp be the tree of shortest paths of the below graph (G1) starting from vertex A and let TMST be a minimum spanning tree of (G1). Circle the only assertion that is FALSE 24 18. A 14 19 30 15 20 16 Both Tsp and TMST Contain the two edges of weight 6 Tsp and TMST have the same number of edges O Tsp and TMST have six edges in common The shortest path between A and H uses exactly 4 edges