Exercise 1 Let A and B being two matrix of degree n, where n=2p and p>=1. 1. Please designusing pseudo-code an optimized divide and conquer algorithm to make multiplication of matrix A* B. 2. Provide the Olg(n)) of this algorithm. Exercise 2 1. Using BFS write a pseudo-code an algorithm that validates if a given word is part of a provided words dictionary. 2. Write similar algorithm using DFS. Exercise 3 Prove or disprove that 5n=0(34) + 12