Let L $=\{$M : M accepts the empty string and does not reject any string$\}.$

a$)$ Prove that L is undecidable.

b$)$ Describe a TM with access to oracle ATM that co$-$recognises L$,$ and argue that it works.

Bonus: Describe a TM with access to oracle ATM that decides L$.$