Given an image f(x, y) with dimensions N times M and a mask mu n times m where m = 2k + 1 and n = 2p + 1. We know that N(n) denotes the number of columns while M(m) the number of rows. Consider that the mask correlates the image such that always stays inside of the image. (f_0, mu)(x, y) = sigma_j = k^P sigma_i = -p^p f(x + i, y + j) mu(i, j). Calculate the number of arithmetic operations taken by the algorithm. Give the answer in terms of N, M, n, m