This document provides the solution to a quiz question that asks students to convert a non-deterministic machine over the alphabet {0,1} to a minimal deterministic machine. The solution labels the states of the non-deterministic machine and uses the subset construction method to find an equivalent deterministic machine. It then checks that all states in the constructed deterministic machine are distinguishable, confirming that the machine obtained from subset construction is minimal.