Which of the following best describes a formal language in the set-theoretic definition? a. A sequence of rules used to derive strings.O b. A subset of all possible strings over a given alphabet. c. A machine that accepts or rejects input strings. d. A collection of non-terminal and terminal symbols.