Mathematics Quizzes Computation Theory

Question:
The minimum number of states in any DFA accepting the regular language L = (111+11111)* is:

Option A):
8
Option B):
9
Option C):
11
Option D):
5

Correct Answer is Option B):
9