The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} is

• A. 3
• B. 7
• C. 5
• D. 6