$1.$Give an efficient and highly parallel multithreaded algorithm for multiplying an n $\backslash$times n matrix A

by a length$-$n vector x that achieves work $\backslash$Theta $($n$2)$ and critical path $\backslash$Theta $($log n$)$ in java

$2.$ write a test program to measure execution time for multiplying a $4,000$ by $4,000$

matrix with a corresponding $4000$ wide vector

$3.$Analyze and discuss the work and critical$-$path length of your implementation and give the

parallelism.