Solution for this please. pay attention to the notes.

Solution must be in C programming language. Please provide a brief explanation of the codes and the efficiency analysis with comments. Question TWO: Devise a dynamic programming algorithm that takes three bit strings X = x! ...x!, Y = y! ...y!, and Z = z ...Z!!!, and output 'YES' if Z is an interleaving of X and Y, and 'NO' otherwise. Note that the string Z is called an interleaving of X and Y if Z can be obtained by interleaving the bits in X and Y in a way that it maintains the left-to-right order of the bits in X and Y. For example, if x = 101 and Y = 01, then Z!= 10011 is an interleaving of X and Y, but Z!= 11010 is not. Also, all the inputs given to the algorithm are assumed to be legitimate, i.e. the users are assumed to provide only bit strings. Input: output: 101 01 10011 YES Input: output: 101 01 11010 NO