The java program ArrayTest.java is intended to do the following: · Fill the array a with integer values input from the file ints.txt. • (Shift-right) Shift the elements of a to the right one position and put the last element of array a in the first position in a (wrap around). Example: if a originally contained (1, 2, 3, 4} then the resulting array a would be (4, 1, 2, 3} The code segment below is intended to read ints.txt into the array a, and to complete the shift-right as explained above. The code does not work as intended. int[] a = StdIn.readAllInts(); int temp = a[a.length - 1]; for(int i = 1; i < a.length; i++){ a[i] = a[i - 1]; |} a[0] = temp; If a was originally {(1,2,3,4,5,6} What would the resulting array contain after the code segment above was executed? Use the text box or a file upload for your answer.

Write a program that stores dynamically allocated array of Movie (using calloc() function). Movie is the Structure with seven fields: name, genre (science fiction – action – drama/love), ticketPrices, list of actors/actresses, ratings(number of tickets sold), cost of production and profit.   In program implementation user enters the following:   Movie Name Movie1 Movie2 Movie3   Genre   Science Fiction   Action   Drama-Love   List of Actors /Actresses         Ratings(number of tickets sold)   720   750   300   Ticket Prices   $45.3   $50.2   $2.3   Cost of production   $5000.5   $7000.1   $100   Net Profit         -   Print the Movie names, list of actors/actresses, ratings(number of tickets sold), ticket prices, cost of production and the total net profit of each movie(net_profit_of_movie)   - Write a function that calculates the net_profit_of_movie; which is the multiplication of ticket prices and…

JAVA:  Suppose that we have a sorted int array called x, with n elements in it and some room to add more elements.  Write the code segment that would add a new item, called target, to the array, so that the array will still be sorted once you are done.

The purpose is to write a program with 2D arrays that will display Knight's Tour. Knight's Tour is a fascinating problem that is done on an electronic chessboard with a knight. Starting at any location on the chessboard, a knight proceeds to move on the board in such a manner that all positions on the chessboard are visited, once and once only. The knight may only move according to the rules of chess playing.  The matrixes below show a sequence of knight moves that starts from the top-left corner.  In most cases, the knight is locked in place and can go no farther. Note: there are only 3 legal knight moves from the 44 locations and they have already been visited. 01 60 39 34 31 18 09 6438 35 32 61 10 63 30 1759 02 37 40 33 28 19 0836 49 42 27 62 11 16 2943 58 03 50 41 24 07 2048 51 46 55 26 21 12 1557 44 53 04 23 14 25 0652 47 56 45 54 05 22 13   01 22 39 20 03 18 09 1600 37 02 23 08 15 04 1335 40 21 38 19 12 17 1000 00 36 41 24 07 14 0500 34 00 32 00 28 11 2600 00 00 00 42 25 06 2900…