Correct Option: D
Since $n$ and $m$ are independent finite memory suffices.
Options (a) and (b) are the same. They and option (c) require keeping track of the counts of $a’s$ which cannot be done using a finite automata but can be done using a DPDA and hence are not regular but DCFL.