For each of the following language descriptions, give a regular expression that matches exactly that language. You dont have to find the shortest possible regular expression. You may use expressions such as [a z] to represent the letters a through z, and/or regular definitions:Best answer(B.A.) will get a like. Also, send other correctly answered questions by B.A. to my email id : smiths.1999420 at the rate g mail dot com. I will give them a like. Please answer the question correctly.

For each of the following NFAs, identify the language accepted by the NFA (describe it or give a regular expression). [ 1 2 start 0 E b 3 (a) b 4,6 d b start 0 1 2 3 (b)