Dados los siguientes puntos geométricos: "P1" ==> (5, 2, 3) P11 ==> (2, 2, 3) "P2" ==> (4, 1, 3) P12 ==> (2, 3, 4) "P3" ==> (2.5, 1, 0) P13 ==> (1, 1, 3) "P4" ==> (0.5, 0.5, 2) P14 ==> (4, 4, 4) "P5" ==> (1, 2, 1) P15 ==> (5, 5, 1) "P6" ==> (6, 2, 1) P16 ==> (1, 0.5, 1) "P7" ==> (3, 2, 0.5) P17 ==> (3, 4, 5) "P8" ==> (2, 6, 1) P18 ==> (3, 1, 2) "P9" ==> (0, 0, 0) P19 ==> (3, 9, 1) "P10" ==> (2, 0, 0.5) P20 ==> (0.5, 0.5, 6) Determine el par de puntos que se encuentran más cercanos. Almacene la respuesta en un string llamado parCercano. Ejemplo: parCercano = "P3-P10"

import math

def distancia_euclidiana(p1, p2):
  x1,y1,z1 = p1
  x2,y2,z2 = p2
  dist = math.sqrt((x1 - x2)**2 + (y1 - y2)**2 + (z1 - z2)**2)
  return dist
puntos = [("P1", 5, 2, 3), ("P2", 4, 1, 3), ("P3", 2.5, 1, 0), ("P4", 0.5, 0.5, 2), ("P5", 1, 2, 1),
          ("P6", 6, 2, 1), ("P7", 3, 2, 0.5), ("P8", 2, 6, 1), ("P9", 0, 0, 0), ("P10", 2, 0, 0.5),
          ("P11", 2, 2, 3), ("P12", 2, 3, 4), ("P13", 1, 1, 3), ("P14", 4, 4, 4), ("