pls answer all the parts and do it neatly on a piece of paper. a$)$ Create pseudocode to solve both or your algorithms from part #$1$ and #$2.$ Note that your algorithms must work for all the NxN matrices where N is an integer. Students won$$t get credit for this problem if they provide code instead of pseudocode.

b$)$ Find the complexity and time complexity of your backtracking algorithm. Show all your work to get credit.

$($c$)(1$ point$)$ Compute the T$($n$)$ functions from your pseudocode created in problem $($d$)(2$ points$)$ Perform the back$-$substitution to your T$($n$)$ functions and define their Theta time and space complexities

e$)$ Explain $($in plain English$)$ if you think that there is a way to optimize the two algorithms covered in this homework. If not, then explain why