A strange number is one whose only prime factors are in the set {2, 3, 5}. Give an efficient algorithm (give pseudocode) that uses a binary heap data structure to output the nth strange number. Explain why your algorithm is correct and analyze the run time of your algorithm. (Hint: Consider generating the strange numbers in increasing order, i.e., 2,3,4,5,6,8,9,10,12,15, etc. Show how to generate efficiently the next strange number using a heap.)