plz do this on oaoepaper then I will upvote. construct the following machines for a language $L$ which accepts all strings of $0\text{'}$s and $1\text{'}$s and need to produce the output as EVEN when the input string has even number of $1\text{'}$s and output as ODD when the input string has odd number of $1\text{'}$s$.$

i$.$ Mealy and Moore machines

ii$.$ Convert the Mealy to Moore and Moore to Mealy.