Question: PSEUDOCODE PLEASE!! 2. [10 pts] Call string C a braiding of strings A and B if it contains all (and only) the characters of both
PSEUDOCODE PLEASE!!
![PSEUDOCODE PLEASE!! 2. [10 pts] Call string C a braiding of strings](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f3ce59725bc_10466f3ce58ee41a.jpg)
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
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
