DESIGN A DFA (DETERMINISTIC FINITE AUTOMATA)
WHICH ACCEPTS
ACCEPTS A STRING CONTAINING
EQUAL NUMBER OF ZEROES & ONES OVER THE
ALPHABET {0, 1}

this is false i think

if it is a true or false question

only #2 represents an object at rest on a table.

in #1, there is no normal force due to the table; the object is accelerating downward.

in #3, the vertical forces are not balanced; the object is accelerating downward.

in #4, neither the vertical nor the horizontal forces are balanced. the object is accelerating upwards and to the right.