10. Construct a binary search tree for the sentence "On second thought let's not go to city, it is a silly place". Your tree should use alphabetic ordering during its construction. [Q10: 5 marks] 11. Create a Huffman compression code for the phrase "Here and Now" (ignoring character case). You answer should include your Huffman code tree (including clear illustration of it's development) plus the resultant encoded phrase