Describe how you would create a DFA to recognize all binary strings that start and end with the exact opposite two characters. For example, a string that starts with 01 and ends with 10 or a string that starts with 01 and ends with 10 and has exactly 5 total characters. If this is not possible, please describe why this is not possible.