HackerCards is a trendy new card game. Each type of HackerCard has a distinct ID number greater than or equal to 1, and the cost of each HackerCard equals its ID number. For example, HackerCard 1 costs 1, HackerCard 5 costs 5, and so on. #!/bin/python3 10 11 # Complete the hackerCards function below. 12 def hackerCards (collection, d): 13 14 > if _name == '__main__':. Leanne already has a collection started. For her birthday, Mike wants to buy her as many cards as he can given his budget. He wants to buy one each of some cards she doesn't already have. If he has to make one choice among several, he will always choose the lowest cost option. Determine which cards he will buy For example, Leanne's collection = [2, 4, 5] and Mike has d = 7 to spend. He can purchase a maximum of 2 cards, the 1 and the 3 to add to her collection. Two other options he has are 1 and 6 (costs more) or 7(fewer cards, costs more). Function Description Complete the function hackerCards in the editor below. The function must return an array of integer ID's of the cards Mike will purchase in ascending order. hackerCards has the following parameter(s): collection(collection [O)collection(n-1)]: an array of integer ID numbers of cards in Leanne's collection d: an integer that denotes Mike's budget Constraints ⢠1sns 105 ⢠1s collection[i] $ 109, where Osi