Transform, using the subset construction, the following nondeterministic finite automaton into an equivalent deterministic finite automaton.

Transform, using the subset construction, the following nondeterministic finite automaton into an equivalent deterministic finite automaton. b 6 a b E Ela 9 b a {p,r} a a 6 {p} a 6 a b {s,9} {p,q} b b a {s,q}) {p} 6 6 a a {s, p, q,r) {p, r} b b a O None of the other three options. b 6 {s,q} {s, p, q,r} 6 a ({s, p, 9} a 6 b a {p} {p, r} a a