Design NFA or NFA null or DFA for the following languages

UPDATE

I am uploading an example of an NFA that has the same alphabets but accepts different language. The language specification is C = {w 2| the bottom row of w is three times the top row}. The example of the strings that need to be accept for such language is and the NFA for such language is given

I hope this gives some insight of what is the theme of the assignment

Update2, NFA will be good for both parts since it is easy. But i am still unable to design one as i am weak in this subject

Suppose you are given the alphabet: = {[01-691-61: (1}. This way the strings generated from have two rows, each row being a string of bits Part 2 Design an NFA, NFA-A or DFA to recognize a language, where each string is such that the second row bit string is the same as the top row string but right shifted by one bit position. For example the following strings are part of the language: CHC and Quic) and 641016) etc. Part 3 Design an NFA, NFA-A or DFA to recognize a language, where each string has a length which is a multiple of three. Every character in the 3r, 6, 9, etc. position is such that the upper bit is the xor of the two upper bits coming before it and the lower bit is the 'and' of the two lower bits coming before it. For example the following strings are part of the language: MHW and HOMMAMUU) etc. H110110 ( 910 sink Suppose you are given the alphabet: = {[01-691-61: (1}. This way the strings generated from have two rows, each row being a string of bits Part 2 Design an NFA, NFA-A or DFA to recognize a language, where each string is such that the second row bit string is the same as the top row string but right shifted by one bit position. For example the following strings are part of the language: CHC and Quic) and 641016) etc. Part 3 Design an NFA, NFA-A or DFA to recognize a language, where each string has a length which is a multiple of three. Every character in the 3r, 6, 9, etc. position is such that the upper bit is the xor of the two upper bits coming before it and the lower bit is the 'and' of the two lower bits coming before it. For example the following strings are part of the language: MHW and HOMMAMUU) etc. H110110 ( 910 sink