Using Python programming: as a Fan of the French game Belote, hamzah wants you to write a function called Belote_Declarations() which perform the following: Simulate solution for the coupon collector, which is a classic statistics problem with many practical applications: The problem is to pick objects from a set of objects repeatedly and find out how many picks are needed for all the objects to be picked at least once. A variation of the problem is to get the quinte-tierce declaration in Belote (8-card sequence [7, 8, 9, 10, J, Q, K, A] regardless of the suits) by picking cards from a shuffled deck of 32 cards (note that in Belote cards from 2 to 6 are not used) repeatedly and find out how many picks are needed before you get the quinte-tierce declaration. Assume a picked card is placed back in the deck before picking another. number of picks needed to get the eight cards sequence, one from each rank and display the eight cards picked (it is possible a card may be picked twice) Hint: you can use the random integer "randint" module in your solution