Develop an algorithm to do convolution on a n*n matrix by a 3*3 kernel assuming CREW PRAM. What is the complexity of your algorithm? What is the complexity of your algorithm, assuming CRCW PRAM?

4 (30\%). Couvolution is the twztmant of a mutix by amothe cmo which is called karmal. Tae convolution of a matrix by a givn kermal in okta bed by guting the kemal in fout of avary aras of the matrix, Hes a sliding minjox, to do the alamantain prodact of the muwbars in the larmal This procent is rapsated by moting the kasme cm wwy powible awa cf the matrix (stride=1), i.6., by moting ona fismant in rou or coherm 4 (30\%). Couvolution is the twztmant of a mutix by amothe cmo which is called karmal. Tae convolution of a matrix by a givn kermal in okta bed by guting the kemal in fout of avary aras of the matrix, Hes a sliding minjox, to do the alamantain prodact of the muwbars in the larmal This procent is rapsated by moting the kasme cm wwy powible awa cf the matrix (stride=1), i.6., by moting ona fismant in rou or coherm