IN SML USE PATTERN MATCHING Implement a function lessThan that compares two fractions x and y and returns true if x is less than y and returns false otherwise. For example,lessThan((2,3) (3,4)) returns true since 2/3 ≤3/4

Design a deterministic finite state automaton (DFA) that accepts exactly the strings over the alphabet {A, B, ...,Z} that contain at least two R, at most one T, and where every E comes after some S (there may be other letters in between). For instance, your DFA should accept the strings: • MYSTICWARRIORS • MARSMATRIX • SHOCKTROOPERS • CONTRAHARDCORPS STRIDER but not the strings • CRAZYTAXI (it does not contain at least two Rs) LASTRESORT (it contains more than one T) AFTERBURNER (there are Es without a S somewhere before them) • BATTLECIRCUIT (all of these at the same time) Clearly indicate the meaning of each state. One way to do this is to number the states and have a numbered list of their meanings, but any readable method you use to label and explain your states is fine. Hint: there are three separate conditions accepted strings must meet; states will need to encode whether or not each one is met (or perhaps partially met). You can label an edge with the word “else" to indicate it…

Q4// Simplify and then implement the Boolean function F(A,B,C,D) = N (1,2,3,5,6,7,9,11,13,15) using POS karnough map , draw the implementation. %3D