Topic: Lexical Analysis- Regular expressions

My question is based on the following topic and consists of two parts:

1. a) Write a regular expression to recognize a string that starts with a number between 0 and 299 inclusively, followed by an x, followed by any combination of zero or more x and y, and ends with y. [Examples of accepted strings: 299xxy, 4xyy, 156xy, 23xxxyyy, 23xxyxyy, 0xxyy; Examples of rejected strings: 300xy, 400yx, 305yyyx, 444yxyxy]

1. b) One way of implementing a specific regular expression as a computer program is to convert the regular expression to its equivalent state-transition machine. Draw an NFA or DFA for your regular expression in part 1.a)