In javasolve the following problem using arrays: past a: coupon collector is a classic statistic problem with many practical applications. the problem is to pick objects from a set of objects repeatedly and determine how many picks are needed for all the objects to be picked at least once. a variation of the problem is to pick cards from a shuffled deck of 52 cards repeatedly and find out how many picks are needed before you see one of each suit. assume a picked card is placed back in the deck before picking another. write a program to simulate the number of picks needed to get total of four cards from each different suit and display the four cards picked (it is possible that a card may be picked twice). here is a sample run of the program: queen of spades5 of clubsqueen of hearts4 of diamondsnumber of picks: 12sample run explanation: as you see in the above run, 12 picks are made to get the four cards from different suits. the other 8 picks (12-4=8) were from the same previously picked suits, so they are not printed. so we continue picking a card until we see at least one card from each of the for suits. note: the card pick is with replacement, meaning that when you pick a card from the deck of 52 card, you put it back in the deck. there is chance to see the previously selected card again. part b: put part a in a for loop and repeat it 10,000 times and report the average number of total picks we should have to see 4 cards from different suits.