please solve it clearly . It is from Graph Theory and Its Applications, Third Edition book

28 Chapter 1 INTRODUCTION TO GRAPH MODELS start lettet accept letter or dicit non-letter any char except letter or digit reject any char Figure 1.3.11 Finite-state recognizer for identifiers. EXERCISES for Section 1.3 13.1% Solve the radio-frequency-assignment problem in Application 1.3.6 by determining the minimum number of colors needed to calor the vertices of the associated graph. Argue why the graph cannot be colored with fewer colors. 1.32 What is wrong with a computer program having the following abstract flow pat- tern? start 1.3.39 Referring to the Markov diagram in Application 1.3.12, suppose that someone just purchased a box of O's. What is the probability that his next three purchases are W's. O's, and then W' ? 1.3.4 Modify the finite-state recognizes in Application 1.3.13 so that it accepts only those strings that begin with two letters and whose remaining characters, if any, are digits. (Hint: Consider adding one or more new states.) 1.3.5* Which strings are accepted by the following finite state recognizer? start 1 accept o reject In Exercises 1.8.6 through 1.3.13, design appropriate graph or digraph models and prob- lems for the given situation. That is specify the wortices and edges and any additional features 1.3.68 Two-person rescue teams are being formed from a pool of volunteers from several countries. The only requirement is that both members of a team matest have a language in common 1.3.7 Suppose that meetings must be scheduled for several committees. Two commit- tees must be assigned different meeting times if there is at least one person on both committees 1.3.8 Represent the relative strength of a finite collection of logical propositional forms. For example, the proposition pq is at least as strong as pq since the first implies the second (ie, (p) (V) is a toutology)