Suppose we have a 2D array M: } } { a) Write an algorithm to traverse this array and make a pair of brackets : Hint: [), {}, () b) Write a separate logic in a form of algorithm, as you get a bracket add it in a linked list node, then find its pair bracket, add it at second position in linked list and so on. c) Must show diagrammatic view of your algorithm. Hint: Next Next d) Suppose Base(M) =400 and there are w=4 words per memory location Find the effective indices E1,E2,E3 and the address of M[{ , ), ]] assuming M is sorted in row-major and column major order. Use diagram for solving and explaining the calculations.