Lab Exercise Computing III12 Consider two strings as follows. ABCBDAB BDCABA The "longest matched substring allowing for gaps" (LMSAFG) is the longest (could be a tie) such substring matched between the two strings such that gaps are allowed but the sequence is maintained (in either direction). So, the LMSAFG are as follows in the given example. BCBA, BCAB, BDAB, BADB, BACB, ABCB Write a program in C++ to print all such LMSAFG using the above test