(a) We have studied two similar looking data structures, the binary-search- tree and the heap. What is the difference between these two? (b) Design an algorithm which, given a binary-search tree, prints out the elements of an n-node tree in sorted order in O(n) time. Can the same be done with a heap? Explain why or why not