Please translate the following pseudocode into compilable java code:

Note: Do not copy and paste from online sources!

function BreADTH-FIRST-SEARCH(problem) returns a solution, or failure node a node with STATE = problem.INITIAL-STATE, PATH-COST = 0 if problem.GoAL-TEST(node.STATE) then return SoLUTION(node) frontier a FIFO queue with node as the only element explored an empty set then retumSOLUTION(node) if EMPty?(frontier) then return failure node POP(frontier) /* chooses the shallowest node in frontier */ add node.STATE to explored for each action in problem.ACTIONs(node.STATE) do child CHILD-NODE( pro lem, node, action) if child.STATE is not in explored or frontier then if problem.GOAL-TEST(child.STATE) then return SoLUTION(child) frontier INSERT( child, frontier)