automata: Would someone pls show how 2.5.2 is done? No need to do 2.5.1, just 2.5.2 with a, b and c

Ur Lises for Section 2.5 * Exercise 2.5.1: Consider the following c-NFA. a) Compute the e-closure of each state. b) Give all the strings of length three or less accepted by the automaton, c) Convert the automaton to a DFA Exercise 2.5.2: Repeat Exercise 2.5.1 for the following e-NFA