Discuss the impact of threaded binary tree on the tree traversal procedure. g. Obtain the optimal Huffman codes for the messages (M1,...,M7) with relative frequencies (q1,...,q7)=(4,5,7,8,10,12,20). Draw the decode tree for this set of codes. (7×4) Q.2 a. Define Space Complexity and time complexity. Give reasons for measuring the space and time complexity. Discuss trade-off between time and space complexity