finite state machine (cs - theory of computation)

I require a efficient solution to the following FSA problem: I already have a "possible solution" for the first component, made using JFLAP, as attached, but I require someone to help fully answer the question or provide a better solution: " Design and present a finite state machine to recognise all strings of digits 0, ..., 9 that have the following property. The consecutive pairs of digits alternate between a strict increase and a strict decrease. For example, 5729891 is accepted but 487231 is not accepted. Also present a finite state machine to accept exactly the strings that are not ac- cepted by the first machine. Give justifications that your machines accept these and only these strings. "