Question 1: For each of the following languages, construct a DFA that accepts the language. In all cases, the alphabet is {0, 1. For each DFA, justify correctness. (1.1) {w {0, 1}* : w starts with 1 and ends with 03. (1.2) (0 {0, 1)' : every odd position in w is 1). The positions are numbered 1, 2, 3,.. ( 1.3) (v {0, 1}* : w has length at least 3 and its third symbol is 0). (1.4) {e,0)