In a stock market, there is a product with its infinite stocks. The stock prices are given for N days, where arr[i] denotes the price of the stock on ith day. There is a rule that a customer can buy at most i number of stocks on ith day(The index starts from 1 ). If the customer has an amount of K amount of money initially, find out the maximum number of stocks a customer can buy. Coding Window def buyMaximumProducts( n,k, price): \#write your code here n=int(input()) price = input ().split() for i in range (n) : price [i]=int(price[i]) k=int (input ()) print(buyMaximumProducts( n,k, price))