Please give clear explanation with diagrams and steps

For each language, define an NFA that recognizes it and that only uses the given number of states. For this problem, all the languages will use the same alphabet ={0,1}. (a) {s101ts,t{0,1}} (using 4 states) This is just a fancy way of writing the set of strings that have 101 as a substring. (b) {0k1nk,nZ+}(using 3 states) Note that Z+refers the set of all positive integers (no 0 ), so this language has strings like 001111,000001 , or 01 , but not strings like 101,000110,11, or