Is there a universal finite automaton? That is$,$ is there a single DFA, say M$,$ such that

given a string sN w$,$ where sN is a string that describes an DFA N and w is an input

string, M accepts sN w if and only if N accepts w$?$ Explain your answer.