rectangular distances.\ located at the first node, i.e.,

(9,19)

. The coordinates list would look as:

[[9,19],[8,8],[2,18],[4,0],[9,6]]

.\ variables route and route_cost\ HARDCODING IS NOT ALLOWED!!! IT MEANS, YOU CANNOT DIRECTLY PRINT THE RESULT WITHOUT PERFORMING ANY OPERATIONS. OTHERWISE, YOU CANNOT PASS THE HIDDEN TESTS!!!\ DO NOT CHANGE ANYTHING IN THE TEMPLATE ASIDE FROM ADDING YOUR OWN CODE IN THE SPECIFIED AREA. OTHERWISE THE TESTS MIGHT NOT WORK AND YOU WILL NOT BE ABLE TO PASS THEM!!!!!\ DO NOT USE ANY BUILT-IN FUNCTION (i.e., count(), index(), reverse(), sort(), sorted(), etc.) in PYTHON.\ For example:\ Answer: (penalty regime:

0%

)\ Reset answer\ import numpy as

np

\ def tsp_heuristics(x_y_coordinates):\ # Insert your code below\ return route, route_cost ** please be quick as you can and please solve this problem in pyhton and solve in simple steps**

rectangular distances. located at the first node, i.e., (9,19). The coordinates list would look as: [[9,19],[8,8],[2,18],[4,0],[9,6]]. variables route and route_cost Note that xycoordinates is defined as input to the function. Do not overwrite values in this variable in your code. Be sure to assign a value to the function output variables (route and route_cost). HARDCODING IS NOT ALLOWED!!! IT MEANS, YOU CANNOT DIRECTLY PRINT THE RESULT WITHOUT PERFORMING ANY OPERATIONS. OTHERWISE, YOU CANNOT PASS THE HIDDEN TESTS!!! DO NOT USE ANY BUILT-IN FUNCTION (i.e., count(), index(), reverse(), sort(), sorted(), etc.) in PYTHON