Question $5$

Not yet answered

Marked out of $1\mathrm{.}00$

P Flag question

The output $Y$ of a $2$ bit comparator is logic I whenever the $2$ bit input $A$ is greater than the $2$ bit input $B.$ The number of combinations for which the output is logic $1,$ is

a$.$ A will never be greater than $B$ in any of the combinations

b$.6$

C$.10$

d$.8$

e$.4$

Clear my choice