JAVA PROGRAMMING

Can someone please help me write the code for this? It is due tomorrow and I have no idea what to do.

605.420 Foundations of AlgorithmsProject 1 Matrices provide a convenient mechanism to manage large amounts of data. Bioinformatics is a field with very large data sets and there are many applications with utilize matrices. Ordinary matrix multiplication is O(n3). With very large matrices, even shaving a small amount off the cost can still give you a worthwhile cost savings. The following reference is an example of using matrix multiplication.Akutsu, T. S. Miyano, & S. Kuhara. 2000.Algorithms for identifying boolean networks and related biological networks based on matrix multiplication and fingerprintImplement Strassens Algorithms in CLRS Chapter 4.2. Be sure to read the entire section and the chapter notes. Check out Appendix D in CLRS for background information on Matrices, if you need it. For the purposes of this assignment, it is only necessary to handle matrices where the size is a power of two.Implement ordinary multiplication and compare your results.Count individual multiplications to use as a basis for comparison. If you want to try timing, please do it in addition to, not instead of counting comparisons.

Make a file with the required input. It should be formatted as follows: the first line should contain the order of the matrix, then follow this by the first matrix, in row major order, reading a row at a time, then the second matrix. Then put a blank line, then the order of the next multiplication and so on. So the beginning of the file with required input will look like this.

Required Input 21 67 15 43 3 2 1 4 -1 2 0 1 2 3 -1 -2 5 1 1 0 -1 2-1 0 3-1 0 2 -4 0-3 1 0 -2 1 2 1 0 1 2 0 -1 -1 -1 Calculate the square of this one. -1 1-1 1 2 0 0 3 1-1 2-3-1 1 1 0 0 2 3 2 1 0 -1 -2 2 3 -1 0 -1 0 -1 0 1 2 2 1 0 1 1 2 3-1 0 2 2 2 2 1 2-2 1-3 3 0 1 2 21 15 3214 1201 123-12 5110 12-10 3-102 40-31 10-212