Solve this question quickly please!!

A company has a warehouse in city A. The total budget of the company is $1000. There are 6 retail outlets. (B, C, D, E, F, G). These retail outlets take orders from customers. The company then ships the products from its warehouse. The company's goal is to meet the product needs of all six retail outlets from stock in the warehouse. Shipping costs are shown above. The company wants to keep shipping costs as low as possible when shipping products to outlets. According to this, which roads should he use in order to start from point A and deliver his products to all points one by one, and return to point A with the lowest transportation cost and without exceeding his budget? Solve this question using Nearest Neighbor algorithm in java.

B $300 $160 $107 $130 (Warehouse) A G $430 $140 D $170 $360 $106 $100 E F