Consider the following finite state automaton (Scott, 2016), which recognizes the language that consisting of digits with a single decimal point, start (q92 Formally, a Deterministic Finite Automaton (FDA) is as quadruple-A over an alphabet where Q is a set of states, q, E Q is an initial state, F is a set of final states, and is a transition function" from a current state and input symbol to a next state, :Q Q. For example, the automaton depicted above is defined as, F (a) where m {0, 1.2.3.45-6,7,8,9) and d e . Hence, in above, we should have defined. Functional Requirements 1. Create a C language program that can be used to construct any arbitrary Deterministic a. Create structs for the: autcomaton. a statc and a transion. For example the automaton should have a "states" field, which captures its set of states as a linked list