my textbook is Artificial Intelligence: A Modern Approach (AIMA) 3th edition

Q: write a complete java code for the given pseudocode, implement all classes and methods that are needed

Chapter 3. Solving Problems by Searching function UNIFORM-COST-SEARCH( problem) returns a solution, or failure node a node with STATE = problem. INITIAL-STATE, PATH-COST = 0) frontier + a priority queue ordered by PATH-Cost, with node as the only element explored an empty set loop do if EMPTY?( frontier) then return failure node POP( frontier) /* chooses the lowest-cost node in frontier */ if problem.GOAL-TEST(node.STATE) then return SOLUTION(node) add node.STATE to explored for each action in problem.ACTIONS(node.STATE) do child - CHILD-NODE( problem, node, action) if child.STATE is not in explored or frontier then frontier + INSERT(child, frontier) else if child.STATE is in frontier with higher PATH-Cost then replace that frontier node with child Chapter 3. Solving Problems by Searching function UNIFORM-COST-SEARCH( problem) returns a solution, or failure node a node with STATE = problem. INITIAL-STATE, PATH-COST = 0) frontier + a priority queue ordered by PATH-Cost, with node as the only element explored an empty set loop do if EMPTY?( frontier) then return failure node POP( frontier) /* chooses the lowest-cost node in frontier */ if problem.GOAL-TEST(node.STATE) then return SOLUTION(node) add node.STATE to explored for each action in problem.ACTIONS(node.STATE) do child - CHILD-NODE( problem, node, action) if child.STATE is not in explored or frontier then frontier + INSERT(child, frontier) else if child.STATE is in frontier with higher PATH-Cost then replace that frontier node with child