please explain why it's NFA and what language it accepts for question 1

question 2. please write down all the steps to draw the NFA.

start ( -SO S3 Figure 1: NFA Language Acceptor CS 457 Written Assignment2 Recall from class how we constructed NFA's from regular expressions and how we used the NFA to DFA algorithm, answer the following: Assignment: 1. Using the algorithm to convert a NFA to a DFA, convert the above NFA 2. For the alphabet = {a, b, draw an NFA (or DFA) to accept the language a' (ab + bb(ab) to a DFA. Make sure you explain the steps (in words). specified by the regular expression