Perform and visualize A* Search
                    What is the main purpose of the A* algorithm?
                  
                  
                  
                
                  
                    What does the heuristic function h(n) represent in A*?
                  
                  
                  
                
                  
                    Which heuristics can be used in A*?
                  
                  
                  
                
                  
                    What does g(n) represent in A*?
                  
                  
                  
                
                  
                    What data structure is commonly used for the OPEN list in A*?
                  
                  
                  
                
                  
                    If h(n) = 0 for all nodes, A* becomes:
                  
                  
                  
                
                  
                    Which of the following ensures A* finds the optimal path?
                  
                  
                  
                
                  
                    Which of the following is a drawback of A*?
                  
                  
                  
                
                  
                    Which part of the f(n) function represents heuristic estimate?
                  
                  
                  
                
                  
                    What kind of search is A* considered as?