plz solve q

HW2 1. Show a finite state machine with input alphabet {0,1} Which accepts any string having an odd number of 1's and an odd number of 0 s 2. Show the binary search tree which would be constructed to store each of the following lists of icentifiers: sum, x3, count, 210,x,33