Prove that the following languages are regular. Draw and give the 5-tuple representations of the DFAs that recognize the following language descriptions: 1. L = { w { a , c , b } :every string w contains c or ( b c ) } 2. L = { w { 0 , 1 } : strings with odd number of 0 AND odd number of 1 } ..