Design an automaton with the given input alphabet that accepts the given set of strings and rejects all other strings, and find a regular expression that defines the same language for the problem:
A machine to accept the set of all strings that start with 101