Using the provided Java code, please help me create the pseudocode, flowchart $($preferred hand$-$drawn$),$ functional requirements, and test plan$/$Test Case Matrix for both projects. In the flowchart, please include multiple charts if there is more than one method.

import java.util.Scanner;

public class Exercise$08\_21\{$

$//$ index info: $0=$ x $|1=$ y $|2=$ total distance to all other cities

$//$ for simplicity

static final int X $=0$;

static final int Y $=1$;

static final int DISTANCE $=2$;

public static void main$($String$[]$ args$)\{$

Scanner input $=$ new Scanner$($System$.$in$)$;

System.out.print$("$Enter the number of cities: $")$;

int numOfCities $=$ input.nextInt$()$;

double$[][]$ points $=$ new double$[$numOfCities$][3]$;

System.out.print$("$Enter the coordinates of the cities:

$")$;

for $($int i $=0$; i $<$ points.length; i$++)$

for $($int j $=0$; j $<$ points$[$i$].$length $-1$; j$++)$

points$[$i$][$j$]=$ input.nextDouble$()$;

double$[]$ central $=$ getCentralPoint$($points$)$;

System.out.printf$("$The central city is at $(\%\mathrm{.}1$f$,\%\mathrm{.}1$f$)$

$",$ central$[$X$],$ central$[$Y$])$;

System.out.printf$("$The total distance to all other cities is $\%\mathrm{.}2$f$",$ central$[$DISTANCE$])$;

$\}$

$/**$ Compute the distance between two points $($x$1,$ y$1)$ and $($x$2,$ y$2)*/$

public static double distance$($

double x$1,$ double y$1,$ double x$2,$ double y$2)\{$

return Math.sqrt$(($x$2-$ x$1)*($x$2-$ x$1)+($y$2-$ y$1)*($y$2-$ y$1))$;

$\}$

public static double$[]$ getCentralPoint$($double$[][]$ points$)\{$

for $($int i $=0$; i $<$ points.length; i$++)\{$

for $($int j $=0$; j $<$ points.length; j$++)\{$

if $($j $!=$ i$)\{$

points$[$i$][$DISTANCE$]+=$ distance$($points$[$i$][$X$],$ points$[$i$][$Y$],$ points$[$j$][$X$],$points$[$j$][$Y$])$;

$\}$

$\}$

$\}$

$//$ find point with the least total distance

$//$ and return central point

double$[]$ central $=$ points$[0]$;

for $($int i $=1$; i $<$ points.length; i$++)\{$

if $($points$[$i$][$DISTANCE$]<$ central$[$DISTANCE$])\{$

central $=$ points$[$i$]$;

$\}$

$\}$

return central;

$\}$

$\}$