Please explain and help with 5a and 5b, thank you .

Use the construction in the proof of Theorem 1.47 to give the state diagrams of NFAs recognizing the concatenation of the languages described in the following languages: L1={w every odd position of w is a 1} L2={ww contains at least two 0s and at most one 1} [That is, construct 2 NFA's and then perform the concatenation of the languages] Use the construction in the proof of Theorem 1.45 to give the state diagrams of NFAs recognizing the union of the languages described in L1={ww is any string except 11 and 111} L2={w every odd position of w is a 1} [That is, construct 2 NFA's and then perform the union of the languages]