Given the descrip$0$on$,$ what is the language of the machine$/$string accepted by the

machine?

a$.$ The language of all strings consis$0$ng of n $0$s followed by n $1$s$,$ for some n $>=0.$

b$.$ The set of strings of $0$s and $1$s with an equal number of each.

c$.$ The set of binary numbers whose value is a prime

d$.$ L $=\{0$n $1|$ n$>=0\}$

e$.$ L $=\{0$n $1$n $|$ n $>=1\}$