@avraw
Hey, you can easily make the NFA accepting all the string in a^nb^n where n < = 10.
Make initial state accepting, then make a state accepting which can accept ab, then make the state accepting which can accept aabb and so on for other string in the language.
Now you can convert this NFA to DFA.