pleasee helpppp fasttttt

10 Let you are given two strings strl and str2. Write a dynamic programming algorithm (not program) to determine the shortest string that has both str1 and str2 as subsequences. In case of multiple results, print any one. Example: If str1 = abac and str2 = cab, then the output sequence is cabac. Demonstrate your algorithm for the sequences strl: BHHUBC and str2: HYUY BZC