i assume block access here is time complexity of sorting the blocks, and plug the values in the formulae := n*k*(lgk)
here n=32 blocks and k=64(number of divisions of file to fit in memory ie, 2048/32)
this results in:= 32*64*(lg64)=12,288 (is it right!?)
*reference := https://www.geeksforgeeks.org/merge-k-sorted-arrays/