The given finite automata generate string like $(1,10,111,110,11111,1011,1110,10000,101111,10011...\infty)$ .
Start with $1$ to reach the final state.after that we have $2$ choices as $(0+11)^*$.
$\therefore $ R.E.= $1(0+11)^*$
Option (B) is correct.