In problems 6-10, draw a finite state machine that accepts only strings of d's and b's described in the problem. 6. strings containing an even number of a's 7. strings containing at most two a's 8. strings ending with a h 9. strhings where every b is followed by an a 10. strings with an even number of d's and an odd number of b's