Write and document a Python program that, given two strings specified in a file that is input as a command-line argument, uses dynamic programming to find the length of the longest sub(str/seq) of those strings and returns one of those longest sub(str/seq)s. An example input file str1.dat is as follows:
stabagot abortExamples of several program runs relative to the item-subset set files str1.dat, str2.dat, str3.dat, str4.dat, str5.dat, and str6.dat are given in script file out.script. It is these results that your program should be able to replicate. ,
######################################################### ## CS 3600 (Winter 2024), Assignment #2, Question #1 ## ## Script File Name: LSSS.py ## ## Student Name: Todd Wareham ## ## Login Name: harold ## ## MUN #: 8008765 ## #########################################################You do not have to develop your code on our CS departmental systems. However, as your code will be compiled and tested on our CS departmental systems as part of the assignment marking process, you should ensure that your code compiles and runs correctly on at least one of these systems.
Created: November 21, 2023
Last Modified: February 12, 2024