Select the items that are required for a DFA to accept a string. Select all that apply.

The state diagram is minimized.

Operation ends on a final $($accept$)$ state.

All states must be reachable.

Operation begins at the start state.

The entire input is consumed.

Operation proceeds according to the transition function.

The input string is at least as long as the pumping length.

All states must be visited.

The string is a member of the language of the machine.