According to the given table, compute the number of transitions with 1 as its symbol but not 0:
(a) 4
(b) 3
(c) 2
(d) 1
I have been asked this question by my school teacher while I was bunking the class.
Query is from Extended Transition Function in section Finite Automata of Automata Theory