solve this question quickly please!!

A person departing from point A must visit each point. Accordingly, in which order should he visit each point and return to point A in order to consume the least fuel oil? Write code and expose code using brute force algorithm in Java. in the content of the code 1) Asking the user the amount of fuel oil to be spent and the amount of fuel oil to be spent between points 2) There must be a code that prints the total amount of fuel consumed according to the amount of fuel oil received from the user, and the roads where the least fuel is consumed according to the amount of fuel oil written by the user, respectively. 3) also write pseudocode of this code

A E D C