Write a C++ program that read 12 integer values from user, store values in Matrix of 4 X 3. Create another Matrix of 4 X 3, divide each element of Matrix1 by five, and store the result in the Matrix2. Print Matrix A, with heading shown, correctly spaced. Print Matrix B, with heading shown, correctly spaced. Your Program should display output as follows:

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…

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…

Write a program in C++ that repeatedly prompts the user to enter a capital for a state. Upon receiving the user input, the program reports whether the answer is correct. A sample run is shown below: What is the capital of Alabama? Montgomery [ENTER]Your answer is correct.What is the capital of Alaska? Anchorage [ENTER]The capital of Alaska is Juneau Assume that fifty states and their capitals are stored in a two-dimensional array, see below. The program prompts the user to enter ten states’ capitals and displays the total correct count.