C# parallel processing

1. Compute Sequential LU decomposition on a matrix (the code is already provided so this is easy). 2. Implement block LU decomposition (as a sequential code) such that user can specify the block size or the number of blocks. Verify that it produces correct results. 3. Implement part 2) using multithreading so that the computation of L and U in the blocks in each row and column is done in parallel (i.e., after the diagonal block computes the L-1 and U-1 in it, the same row blocks can compute the U in parallel and same row columns can compute the L in parallel) 4. Implement part 3) as an asynchronous algorithm using manual reset events and launching all blocks as threads in the beginning. Use 2-D arrays of manual reset events to coordinate the execution in different blocks. 5. Use TPL and Task continuations to implement part 4) 6. Provide graphs comparing the execution times of different approaches as a function of block size.