**R-6.14**: Draw a (single) binary tree T such that- each internal node of T stores a single character
- a
*preorder*traversal of T yields`EXAMFUN`

- an
*inorder*traversal of T yields`MAFXUEN`

Illustrate the performance of the heap-sort algorithm on the following input sequence: (2,5,6,8,9,4,10,3,11,7,1). Do it both with and without "bottom-up heap construction".

**C-7.17**: Describe an algorithm that computes the*k*th smallest element of a set of*n*distinct integers in*O*(*n*+*k*log*n*) time.**C-7.14**: Let T be a heap storing*n*keys. Give an efficient algorithm for reporting all the keys in T that are smaller than or equal to a given query key*x*(which is not necessarily in T).- Any questions about Assignment 2.