Write a program to implement the A* algorithm in python that will solve the 8-puzzle problem. The program will implement all three heuristics (h1, h2, & h3) from task 1. The program will also implement an additional heuristic, h4 = max(h1, h2, h3), and utilize it at each node. Your program will have two input options for the initial configuration. Either it can be taken as input from the user, or it can be randomly generated. The program will calculate three metrics to measure the performance of the program: time required, peak memory usage, and the number of nodes generated. Before starting to generate the nodes, the program will print the input configuration and its initial heuristic values. Output metrics will be printed for all 4 heuristics.

Write a program to implement the A* algorithm in python that will solve the 8-puzzle problem. The program will implement all three heuristics (h1, h2, & h3) from task 1. The program will also implement an additional heuristic, h4 = max(h1, h2, h3), and utilize it at each node. Your program will have two input options for the initial configuration. Either it can be taken as input from the user, or it can be randomly generated. The program will calculate three metrics to measure the performance of the program: time required, peak memory usage, and the number of nodes generated. Before starting to generate the nodes, the program will print the input configuration and its initial heuristic values. Output metrics will be printed for all 4 heuristics.