Please to this in ocaml. Needed urgently. I will thumb up

let rec nfa_sim (nfa: nfa) (states: state list) (input: symbol list) : bool =

let states' = eps_clos nfa states

in

Implement the function nfa_sim: nfa -> state list -> symbol list -> bool. nfa_sim nfa states input should: Let states' be the e-closure of states (we've done this part for you) If we're out of input, return true if any state in states' is an accepting state, otherwise return false. Otherwise, look at the next symbol, update the set of states accordingly, and call nfa_sim with the new set of states. Hint: You may (or may not) find the standard library function List.exists helpful. Implement the function nfa_sim: nfa -> state list -> symbol list -> bool. nfa_sim nfa states input should: Let states' be the e-closure of states (we've done this part for you) If we're out of input, return true if any state in states' is an accepting state, otherwise return false. Otherwise, look at the next symbol, update the set of states accordingly, and call nfa_sim with the new set of states. Hint: You may (or may not) find the standard library function List.exists helpful