**A strange number is one whose only prime factors are in the set {2, 3, 5}. Give an efficient algorithm (give pseudocode in c) 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.)**

### Recently Asked Questions

- Please Provide a Sample Paper You Decide: Chocoberry—Part 2: Distribution Plan Scenario/Summary Chocoberry evaluated all the ideas and decided to proceed

- How to calculate owners equity and how to verify if correct

- Given the following potential energy for a molecular vibration: V(x)=1/2kx 2 +c 1 x 3 +c 2 x 4 +c 3 x 5 Use first order perturbation theory to calculate the