For this given code, please help me create a recursive case for transpose of matrix using the cache oblivious algorithm. for ( size_t i=0; i

For this given code, please help me create a recursive case for transpose of matrix using the cache oblivious algorithm. for ( size_t i=0; i< block="" &&="" i="" +="" b="">< n;="" ++b){="" b[="" j*n="" +="" i="" ]="a[" i*n="" +="" j="" ];="" }="" }="" else="" {="" recursmattranspose="" (="" n,="" n,="" a,="" 0,="" 0,="" b,="" 0,="" 0="" );="" recursive="" case="" using="" cache-oblivious="" algo="" }="">