data structure coding in java by using simple code

Problem PayMoney. processes thousands of transactions daily amounting to crores of Rupees. also have a daily target that they must achieve. Given a list of transactions dor PayMoney and a daily target, your task is to determine at which transaction PayM achieves the same. If the target is not achievable, then display the target is not achievt Explanation Target 1 i.e 21 is achieved after 2 transactions, (20+12) Target 2 i.e 19 is achieved in the 1 st transaction itself. Test Case 2 enter the size of transaction array 1 enter the values of array 100 enter the total no of targets that needs to be achieved 1 enter the value of target 101 Given target is not achieved the size of transaction array the values of array the total no of targets that needs to be achieved the value of target en target is not achieved lanation since there is only 1 transaction that is of 100 and the target valu ce target is not achieved. Marks (12) are a traveler and traveling to a country where the currency denomina hown and as you travel you get to know about the denomination in random