Please give concise steps to how you would solve this problem. I want to be able to solve other problems similar to this as well.

Let = {0, 1} and let x be the value of a string of unsigned binary numbers. Make a state diagram of a machine that recognizes the language of A.

A = {x|where x is greater than or equal to 2 and less than or equal to 5}

For example:

100 is accepted, it is 4

00000101 is accepted, it is 5

1111 is rejected, it is 15