Arun is a stock trader who wants to maximize his profit by buying and selling stocks at the right time. He has two lists of stock prices for two different companies. Arun wants to merge these lists and find the maximum profit he can make by buying and selling stocks from the merged list.Write a program to help Arun find the maximum profit he can make from the merged list of stock prices.ExampleInput:25 1028 15Output:10Explanation: The maximum profit can be obtained by buying at price 5 and selling at price 15, resulting in a profit of 15 - 5 = 10.Company Tags: AdobeInput format :The first line of input consists of an integer N, representing the size of the first dataset.The second line consists of N space-separated integers, representing the daily stock prices in the first dataset.The third line consists of an integer M, representing the size of the second dataset.The fourth line consists of M space-separated integers, representing the daily stock prices in the second dataset.Output format :The output prints a single integer, representing the maximum profit that can be made by buying and selling the stock.Refer to the sample output for formatting specifications.Code constraints :1 ≤ N, M ≤ 101 ≤ stock prices ≤ 500Sample test cases :Input 1 :25 1028 15Output 1 :10Input 2 :37 3 642 9 5 4Output 2 :7

A,B and C invested Rs 15000,Rs 20000 and Rs 25000.The net profit for the year was Rs 13000.Find out the amount of profit each partner has earned.A share-Rs.3250B share-Rs.4333.33C share -Rs.5416.67A share-Rs.2250B share-Rs.3563.27C share -Rs.5400.56A share-Rs.4500B share-Rs.2580.25C share -Rs.5416.67None of these

A, B and C are partners in a business. Their capitals are respectively, Rs.5000, Rs.6000 and Rs.4000. A gets 30% of the total profit for managing the business. The remaining profit is divided among three in the ratio of their capitals. In the end of the year, the profit of A is Rs.200 more than the sum of the profits of B and C. Find the total profit.ARs. 4500BRs. 5200CRs. 1800DRs. 3000

The profit maximising output of a competitive firm is given as, MR=MC. This may also be written as;Group of answer choicesP=ACP=MCMR=PMR=AC

Maximum ProfitSay you have an array, A, for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most 2 transactions.Return the maximum possible profit.Note: You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).Problem Constraints1 <= length(A) <= 7e51 <= A[i] <= 1e7Sample input57 2 4 8 7Sample output6ExplanationInput: 57 2 4 8 7The first line contains the number of elements in the array.And, the second line contains the element of array.Output:6

A' and 'B' started a business by investing in the ratio of 5:7, respectively such that 'B' invested Rs. 600 more than 'A'. After 6 months, 'A' left the business and after two more months, 'C' joined by investing an amount which is twice that by 'A'. Find the profit share ratio of 'A', 'B', and 'C', at the end of the year. a. 10:13:12 b. 5:9:6 c. 15:42:20 d. 10:14:17