Monk and Inversions Monk's best friend Micro, who happen to be an awesome programmer, got him an integer matrix M of size N x N for his birthday. Monk is taking coding classes from Micro. They have jus completed array inversions and Monk was successful in writing a program to count the number of inversions in an array. Now, Mic has asked Monk to find out the number of inversion in the matri: M. Number of inversions, in a matrix is defined as the number of unordered pairs of cells {(i, j), (p, q)} such that M(i][j] > M\p][q] & i

Your Friendly Array Neighbor   Program only in java not in python Create a Java program that takes an array called ar as an input that keeps track of arrays. Every day a new array is produced using the array of the previous day. On the n’th day, the following operations are performed on the array of day n – 1 to produce the array of day n:   -If an element is smaller than both left and right neighbor, then this element is incremented -If an element is bigger than both its left neighbor and its right neighbor, then this element is decremented. -The first and last elements should never change   Eventually after some days the array will not change, some examples:   Example: Input from user: ar = [6,2,3,4] Output from program: [6,3,3,4] After the first day the array is changed from [6,2,3,4] to [6,3,3,4] and no further operations may be completed.   Example: Input from user: ar = [1,6,3,4,3,5] Output from program: [1,4,4,4,4,5]   After the first day the array is changed from [1,6,3,4,3,5]…

java - netbeans

Using a Java program solve the following problem using arrays: Past A: Coupon collector is a classic statistic problem with many practical applications. The problem is to pick objects from a set of objects repeatedly and determine how many picks are needed for all the objects to be picked at least once. A variation of the problem is to pick cards from a shuffled deck of 52 cards repeatedly and find out how many picks are needed before you see one of each suit. Assume a picked card is placed back in the deck before picking another. Write a program to simulate the number of picks needed to get total of four cards from each different suit and display the four cards picked (it is possible that a card may be picked twice). Here is a sample run of the program: Queen of Spades 5 of Clubs Queen of Hearts 4 of Diamonds Number of picks: 12 Sample run explanation: As you see in the above run, 12 picks are made to get the four cards from different suits. The other 8 picks (12-4-8) were from the…