Please write a python code to solve the code challenge. Use the sample input and output.

Note: This is just a sample problem. The inputs for actual problems are much longer than this. Please try to make a code that will work if I have this same problem with an input that is over 1,000 characters long.

. Code Challenge: Solve the Overtap Graph Problem (restated below). Input: A collection Patferns of k-mers. Output: The overlap graph Overlap(Patterns), in the form of an adjacency list. (You may return the nodes and their edges in any order.) Note: You don't need to account for repeated elements in Patterns in this problem Extra Dataset and Test Datasets Sample Input: ATGCG GCATG CATGC AGGCA GGCAT GGCAC Sample Output: CATGC -> ATGCG GCATG -> CATGC GGCAT -> GCATG AGGCA -> GGCAC, GGCAT