Define a "sweep right" Turing machine to be the variant of a sweeping Turing machine that always steps right.

a) Deterministic machine
b) Non-deterministic machine
c) One-way finite automaton
d) Two-way finite automaton