Please don't use this answer, I have already looked at this and still don't understand.

https://www.chegg.com/homework-help/questions-and-answers/let-d-q-2-8-qo-f-dfa-construct-new-dfa-d-d-l-d-w-w-e-l-d-8-2-e-l-d-contains-every-string-w-q51404036

3. Let D= (Q, 8, 8,20,F) be a DFA. Construct a new DFA D' from D such that L(D') = {w * : w L(D) for some Be S*}, i.e., L(D') contains every string w that is a prefix of some string in L(D). (Hint: Try to modify the set F of accept states in D.) Prove the correctness of your construction. 3. Let D= (Q, 8, 8,20,F) be a DFA. Construct a new DFA D' from D such that L(D') = {w * : w L(D) for some Be S*}, i.e., L(D') contains every string w that is a prefix of some string in L(D). (Hint: Try to modify the set F of accept states in D.) Prove the correctness of your construction