On the equivalence issue of a class of $2$-dimensional linear Maximum Rank Distance codes