Consider the language of all words over {a, b} that either begins and ends with aa or bb (but both are the same within each word). That is, {ccycc | c ∈ {a, b}, y ∈ Σ ∗}
I have drawn the resulting NFA for the language described above, what would the corresponding DFA look like? What would the steps look like to get from an NFA to a DFA?