Kleene's theorem should be used to find a regular expression that generates the language accepted by the following TG (Transition Graph):

In the process, states are eliminated until only the start and final states are left with an edge connecting them and with a label that represents the required regular expression. Which one of the following is the result of eliminating state 3?

A

B

C

D

3 b a aa aa,bb 1- 2 5+ a,b bb 4+ aa+bb ba 5 baa ab+ba a+b bb 4 aa aa+bb ba baa a+b bb 5 + aabb ba 5 baa a,b bb bb 4 + aa+bb ba 5 baa a+b bb 4 +