Draw the state diagram of an NFA accepting the language of all strings over {a, b} that end with the substring abba or that start with an odd number of bs. Use non-determinism to make your state diagram as simple as possible.