2. [10 pts] Call string C a braiding of strings A and B if it contains all (and only) the characters of both A and of B and if their respective order is preserved in C. For example, C -aacabbaa is a braiding of A- aaba and B-caba (demonstrated as follows: aacabbaa). Give an algorithm that, given strings A, B, and C, decides whether C is an braiding of A and B in polynomial time. Prove your answer correct