Question: Write a Python Program to Implementation of A* Search in Artificial Intelligence.   Requirements:   Graph Values have to take from User Input Source Node have to take from User Input Goal Node have to take from User Input Please follow one of the most Easiest Method for this Algorithm. Don't make the program complex.

i. Using the graph below, implement the Iterative Deepening Search algorithm considering the final state is six(6) and the initial state is zero(0) using the python programming language.   N.b Kindly add comments to your code ii.. Descriibe in summary how the algorithm was implemented.

There are various sorting algorithms available to sort data of different sizes. Three of these algorithms are Bubble sort, Shell sort, and Quicksort. In Python, write a program to generate random integer numbers of multiple sizes; 10000, 30000, 40000, 50000, and 70000, and find out which of these sorting algorithms perform the fastest sorting technique. Provide data to prove and support your findings or results by plotting a graph showing the time each takes to sort data of various sizes. It should be written in a single program. Write the code in python and also show the graphical result. Also do the proper identation of the code.

Looking for python guidance for the code comments.  Write a program that replaces words in a sentence. The input begins with word replacement pairs (original and replacement). The next line of input is the sentence where any word on the original list is replaced. Ex: If the input is: automobile car manufacturer maker children kids The automobile manufacturer recommends car seats for children if the automobile doesn't already have one. the output is: The car maker recommends car seats for kids if the car doesn't already have one.    Looking for python guidance for the code comments.