please use the following formula and write a code in java to achieve linear convolution

Do the sum only from k=0 to k=N-1 (N=filesize),

and assume x[n] and h[n] are zero for nN.

The result should be y[n] from n=0 to N-1.

please do not implement "wraparound," and do not use the FFT or any other frequency domain methods to implement convolution.

thank you and please comment the code so that it easily understood

y[n- x[k]h [n-k], for all n 1l