Please provide the java code. Please don't post as pics

Competitive Test "Axcent Academy" has arranged for a competitive test for medical students from rural villages. Those successful students of the test will be awarded the scholarship for their NEET preparations at Axcent Academy. Benny, the co-coordinator and founder of the academy has given one problem for the first stage of the test. The problem goes like this: Given an array A1, A2, ..., AN, count the number of subarrays of array A which are non-decreasing. A subarrayAli, il, where 1 SiSjSN is a sequence of integers Ai, Ai+1,..., Aj. A subarrayA[i, j] is non-decreasing if Ai S Ai+1 S Ai+2 s... SAj. Count the total number of such subarrays. Benny himself has not computed the solution of the problem. Write a program to help him find the answer for the same to evaluate the students. Input Format The first line of input contains a single integer N denoting the size of array. Assume that the maximum value for N as 50. The second line contains N space-separated integers A1, A2, ...,AN denoting the elements of the array. Output Format Output in a single line, the count of the total number of such subarrays. Sample Testcases Testcase 1 Input Testcase 1 Output 1 4 2 3 Testcase 2 Input Testcase 2 Output 314