from typing import List, Unionimport mathdef distance$($a: int, b: int, c: int, d: int$)->$ float: $\text{'}\text{'}\text{'}$ returns the Euclidean distance between locations $($a$,$b$)$ and $($c$,$d$).>>>$ distance$(2,5,8,3)6\mathrm{.}324555320336759>>>$ distance$(12,5,15,1)5\mathrm{.}0\text{'}\text{'}\text{'}$ def is$\_$safe$($plant$\_$row: int, plant$\_$col: int, frog$\_$map: List$[$List$[$int$]])->$ bool: $\text{'}\text{'}\text{'}$ Returns True if building a plant at position $($row$,$col$)$ is safe, considering the given frog$\_$map. Returns False otherwise $>>>$ frog$\_$map $=[[0,0,0,0,0,0,0,0,0],\backslash [0,0,0,1,0,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,0,0,1,0,0,1],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,1,1,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0]]>>>$ is$\_$safe$(5,1,$ frog$\_$map$)$ False $>>>$ is$\_$safe$(10,4,$ frog$\_$map$)$ False $>>>$ is$\_$safe$(10,0,$ frog$\_$map$)$ False $>>>$ is$\_$safe$(8,7,$ frog$\_$map$)$ True $>>>$ is$\_$safe$(10,5,$ frog$\_$map$)$ True $\text{'}\text{'}\text{'}$ def number$\_$safe$\_$locations$($frog$\_$map: List$[$List$[$int$]])->$ int: $\text{'}\text{'}\text{'}$ Returns the number of locations where a plant could be installed. $>>>$ frog$\_$map $=[[0,0,0,0,0,0,0,0,0],\backslash [0,0,0,1,0,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,0,0,1,0,0,1],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,1,1,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0],\backslash [0,0,0,0,0,0,0,0,0]]>>>$ number$\_$safe$\_$locations$($frog$\_$map$)22\text{'}\text{'}\text{'}$ Pls rectify the solution. It passed only $20/35$ tests