provide python code, and working results from the sample files

Project 1 Introduction In this project, we will be using the toy water pitcher problem to expand on our understanding of the "search" problem. The learning objectives are: (i) Search problem (ii) Dynamically creating a graph, when there are no nodes or edges in sight. (iii) A* algorithm, heuristic, and lower bound Input and Output You are given a text file with 2 lines. First line has a variable number of integers, comma separated. Second line has an integer. There are no comments etc. in the file. (Don't bother trying to handle negative numbers, fractional numbers, alphanumeric test cases etc. I trust you know how to do that, and this class is not focused on that.) Input File Structure input.txt 1,4,10,15,22// Represents the capacities of the different water pitchers // You also have access to a virtual "infinite" capacity pitcher 181 // Represents the Target quantity Sample Files > cat input1.txt 2,5,6,72 143 >> cat input2.txt 3,6 2 > cat input3.txt 2 143 >> cat input4.txt 2,3,5,19,121,852 11443