2. You have N magical bags of candies in front of you. The ith bag has Ai candies in it. It takes you one minute to finish a bag of candies, no matter how many candies are in it. Every time you finish a bag with X candies in it, the bag is magically replenished with 2X more candies. Write a program that determines the maximum number of candies you can eat in K minutes. The input is a sequence of integers. The first integer N is the number of bags. Then next integer K is the number of minutes you have. The next N integers are the number of candies in the bags. The output of your program is a single integer that represents the maximum number of candies you can eat