Project 7: LISDue: Friday April 26, 11:59 pm1 Assignment OverviewFor this project you will implement a dynamic program that solves the longest increasing subsequenceproblem. A sequence S is a subsequence of another sequence T if you can produce S by removing someitems from T (without reordering them). For instance, [0, 2, 5] is a subsequence of [0, 1, 2, 3, 4, 5,], but [5,2, 0] is not. Your objective is to find the longest possible subsequence whose items are strictly increasing(that is if i 2 Assignment DeliverablesYou must turn in completed versions of the following files: Lis.pyBe sure to use the specified file name and to submit your files for grading via Mimir before the projectdeadline.3 Assignment SpecificationsYour task will be to complete the methods listed below: verify subseq: Determines whether one sequence is a subsequence of another. verify increasing: Determines whether a sequence is in increasing order. find lis: Finds the longest increasing subsequence of the given sequence.If multiple subsequences each have the maximum possible size you may return any of them.You may use any of the standard collections discussed in class as well as the built-in functions that actupon them. You may add any additional helper functions that you need.You may assume that each sequence contains mutually comparable items (they have a you cannot make other assumptions about their types. You are not allowed to modify the input sequence inany way. The sequence is indexable (but it might not be a list).Both of the verification methods should run in O(n) time and require only a constant amount of extraspace. While a O(n2) solution to the find lis method is readily apparent, your solution should takeO(n log n) time and require at most O(n) extra space.You should include comments where appropriate. In particular, you should describe the method usedfor computing the LIS. You must also add documentation for each of the above methods (as well as for anyhelper functions created).14 Assignment Notes Points will be deducted if your solution has warnings of any type. You have been supplied with stubs for the required methods. You must complete these methods tocomplete the project. You may add more functions than what was provided, but you may not modifythe signatures of the provided methods. You have been provided with some unit tests that can be used to assess your solution. There areadditional test cases that will be kept hidden. It is your responsibility to check for potential edge cases. The supplied unit tests do not account forall possible valid inputs You may use a wide variety of collections classes. You may want to use list, set, dict, heapq, deque,or defaultdict. The items in the subsequence must be strictly increasing. Equal items are not allowed. You may not modify the input sequence. Some of the tests give you a string (character sequence) instead of a list. You may still return a listrather than a string.2本团队核心人员组成主要包括BAT一线工程师，精通德英语！我们主要业务范围是代做编程大作业、课程设计等等。我们的方向领域：window编程 数值算法 AI人工智能 金融统计 计量分析 大数据 网络编程 WEB编程 通讯编程 游戏编程多媒体linux 外挂编程 程序API图像处理 嵌入式/单片机 数据库编程 控制台 进程与线程 网络安全 汇编语言 硬件编程 软件设计 工程标准规等。其中代写编程、代写程序、代写留学生程序作业语言或工具包括但不限于以下范围:C/C++/C#代写Java代写IT代写Python代写辅导编程作业Matlab代写Haskell代写Processing代写Linux环境搭建Rust代写Data Structure Assginment 数据结构代写MIPS代写Machine Learning 作业 代写Oracle/SQL/PostgreSQL/Pig 数据库代写/代做/辅导Web开发、网站开发、网站作业ASP.NET网站开发Finance Insurace Statistics统计、回归、迭代Prolog代写Computer Computational method代做因为专业，所以值得信赖。如有需要，请加QQ：99515681 或邮箱：99515681@qq.com 微信：codehelp
网友评论