Suppose we have two sets of $($x$,$y$)$ coordinates represented by a matrix S of size M x $2$ and a row vector T of size $1$ x $2.$ The goal is to find the Euclidian distance between each of the M points in S with the $($single$)$ point in T$.$ The result should be a column vector D of size M x $1.$ Give Matlab code that performs this calculation without using the builtin Matlab functions "dist", "pdist", or "pdist$2"$ and without using loops

For example, suppose

S $=[21$; $32$; $52]$;

T $=[32]$;

Your code should produce the answer:

$1\mathrm{.}4142$

$0$

$2\mathrm{.}0000$

Alternatively, suppose

S $=[21$; $32$; $52$; $44]$;

T $=[32]$;

Your code should produce the answer:

$1\mathrm{.}4142$

$0$

$2\mathrm{.}0000$

$2\mathrm{.}2361$

In other words, your code should work with any number of rows $($M$)$ for matrix S and the value of M should not be "hard coded"