identify the language recognized by the given deterministic finite-state automaton. I tried choice #3 and it is wrong.

Identify the language recognized by the given deterministic finite state automaton. {lambda} intersection {1} {0, 1} * intersection {0}{1} * {0} {0, 1} * {lambda} intersection {0, 1} * intersection {1} * {0, 1} * {1} {0, 1} * union {0}{1} * {0} {0, 1}* {lambda} union {0, 1} * union {0}{0, 1} * union {0} {1} * {0}{0, 1}*