a. Give an algorithm in Python to find all nodes less than some value, X, in a binary heap. Your algorithm should be in O(K), where K is the number of nodes output. Use the set up below:

#GOAL: Write a function that will return all elements smaller than a threshold t from the binary heap bh

def getSmallerThan(binaryHeap, t):

listOfElements=list()

#implement your function here

return listOfElements

print(getSmallerThan(bh,5))

b. Explain what O(K) means and how you come up with such an algorithm.