DFA for the languages accepting strings for b^m a b^n : m, n greater than 0 over

Design a DFA for the languages accepting strings for b^m a b^n : m, n greater than 0 over over ∑ ={a,b}