Please provide the Java source code for the Best-First Search with Branch-and-Bound pruning algorithm (Algorithm 6.3) for the Travelling Salesperson problem.

void travel2 (nt n const number WIl ordered-set&&opttour number& minlength) priority-queue of.node PQ; node u, initialie (PO) // Initialize PQ to be empty // Make first vertex the // starting one. t' , path= [1]; u, bound = bound(r); minlengthoo; insert (PQ, ); while ( empty (PO)) remove (PQ, ) // Remove node with best bound if (.bound