hello. this is a discrete math/computer science problem. i have absolutely no idea what this question even means..the picture on the top is the actual problem and in the bottom is what my instructor told us he wants us to find. even after he explained it i still dont know where to start. can you help me out here? thanks

Consider the following inductive definition of a composed bit string of O's and 1's. Foundation: The empty bit string is a composed bit string. Constructor: If s and t are composed bit strings, then so are Os1t and 1sOt. Part a: List the composed bit strings that can be creatd with just one application of the constructor rule Part b: List the composed bit strings that can be created by applying the constructor rule to bit strings that can be created with one or zero applications of the constructor rule. (Hint: there are 16 distinct bit strings.) See clarification on Piazza e regarding what is being asked for Part c: Use structural induction to show that every composed bit string consists of an equal number of O's and 1's. Make sure to indicate what P(n) is (i.e., the predicate you are proving holds true for all natural numbers n)