Javafx support needed asap

I am looking javafx support for my project and this needs to be done ASAP. I am attaching the detailed information in pdf pl check attached docs and only bid you understand it properly. I would hire after that. 

There are few problems which needs to answer. 

Pl check the pdf for all problems to solve. 

Programming

For both of these problems, you should be prepared for 1000 × 1000

matricies; that is, 0 < n ≤ 1000.

1. Implement, in Java, the naive matrix multiplication

algorithm, and provide some test cases that you will be able to

generate answers to compare for the next part1

.

2. Implement, in Java, your divide-and-conquer algorithm to

multiply two matricies. Note that you will need to perform the

expansion for n which are not powers of 2; and you should remove the

extraneous rows and columns from the output afterwards.

Your program should read input from System.in comprised of 2n + 1

lines; the first one is n, telling you the dimension of each matrix. Then

the first matrix is given on n lines, each containing one row of the

matrix; and that row will be n real numbers. The remaining n lines

will be the second matrix to be multiplied. Print the product matrix to

System.out, in the same format as the input matricies.

 Thanks