Compute the Euclidean distance for each point $($X$,$ Y$)$ from the origin $(0,0).($Hint:

# euclidean distance $=$ sqrt$(($x$2-$x$1)^2+($y$2-$y$1)^2)).$ Expected output is a $2$ X $5$ numpy

# array, with each value representing the distance from the origin.

$($Note: The resultant arrays need not be in the same shape and dimensions as the arrays Z and A$)$

o Compute an array which has the elements present in Z but not in A

o Compute an array with the sorted common elements that are present in Z and A

o Compute the sorted union of Z and A

o Compute a Boolean array indicating whether each element of Z is contained in A

o Find those elements which are either in Z or A$,$ but not both arrays