Karp's algorithm for minimum$-$man circuit$($MMC$)$ has O$($mn$)$ time complexity and O$($n$^2)$ space complexity. Describe a modification of karp's algorithm which maintains the O$($mn$)$ time complexity but has linear space complexity