Please help with this problem with Finite State Machine and Trie. Thank you!

Draw the FSM to find the pattern "aabaa", and list the sequence of states you would pass through when searching for this pattern in the text "aaabaadaabaaa". Assume that Z= {a,b}. Draw a standard trie for the following set of strings: {abab, baba, ccccc, bbaaaa, caa, bbaacc, cbcc, cbca}. Draw the resulting binary search tree from inserting the nodes 5, 3, 7, 9, 2, 4, and then deleting the node 3