rectangular distances.

located at the first node, i$.$e$.,(9,19).$ The coordinates list would look as: $\left[\begin{array}{cc}9& 19\\ 8& 8\\ 2& 18\\ 4& 0\\ 9& 6\end{array}\right].$

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$**$The beginning of the code is given, do it accordingly