Please code in JAVA all TODO sections:

package algs$32.$kdtree;

import algs$12.$Point$2$D;

import algs$13.$Queue;

import stdlib.$*$;

$/*$ a set of points implemented as kd$-$tree $*/$

public class KdTree $\{$

private static class Node $\{$

$//$ TODO

$\}$

private Node root;

$/*$ construct an empty set of points $*/$

public KdTree$()\{$

$//$ TODO $--$ maybe nothing to do here... in which case you can remove this and use the default constructor

$\}$

$/*$ is the set empty? $*/$

public boolean isEmpty$()\{$

$//$ TODO

return false;

$\}$

$/*$ add the point p to the set $($if it is not already in the set$)*/$

public void insert$($Point$2$D p$)\{$

$//$ TODO

$\}$

$/*$ does the set contain the point p$?*/$

public boolean contains$($Point$2$D target$)\{$

$//$ TODO

return false;

$\}$

$/*$ all points in the set that are inside the target rectangle $*/$

public Iterable range$($RectHV target$)\{$

$//$ TODO

return new Queue$<>()$;

$\}$

$/*$ a nearest neighbor to target point; null if empty $*/$

public Point$2$D nearest$($Point$2$D target$)\{$

$//$ TODO

return new Point$2$D $(0,0)$;

$\}$

$/*$ draw all of the points to standard draw $*/$

$/*$ for x$-$node, use red line to draw the division between left$/$right $*/$

$/*$ for y$-$node, use blue line to draw the division between top$/$bottom $*/$

$/*$ see the writeup for examples $*/$

public void draw$()\{$

$//$ TODO

$\}$

$/*$ some test code $*/$

public void toGraphviz$()\{$ GraphvizBuilder.nodesToFile $($root$)$; $\}$

private static void insert$5$Points $($KdTree kdtree, double xoffset, double yoffset$)\{$

kdtree.insert $($new Point$2$D $(0\mathrm{.}7+$ xoffset, $0\mathrm{.}2+$ yoffset$))$;

kdtree.insert $($new Point$2$D $(0\mathrm{.}5+$ xoffset, $0\mathrm{.}4+$ yoffset$))$;

kdtree.insert $($new Point$2$D $(0\mathrm{.}2+$ xoffset, $0\mathrm{.}3+$ yoffset$))$;

kdtree.insert $($new Point$2$D $(0\mathrm{.}4+$ xoffset, $0\mathrm{.}7+$ yoffset$))$;

kdtree.insert $($new Point$2$D $(0\mathrm{.}9+$ xoffset, $0\mathrm{.}6+$ yoffset$))$;

$\}$

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

KdTree kdtree $=$ new KdTree $()$;

insert$5$Points $($kdtree$,0\mathrm{.}0,0\mathrm{.}0)$; $//$ after this there should be $5$ points

insert$5$Points $($kdtree$,0\mathrm{.}0,0\mathrm{.}0)$; $//$ after doing it twice there should still be $5$

insert$5$Points $($kdtree$,0\mathrm{.}1,0\mathrm{.}0)$; $//$ this should add $5$ more points

insert$5$Points $($kdtree$,0\mathrm{.}0,0\mathrm{.}1)$; $//$ this should add $5$ more points

$//$ kdtree.insert $($new Point$2$D$(0\mathrm{.}15,0\mathrm{.}18))$;

$//$ kdtree.insert $($new Point$2$D$(0\mathrm{.}86,0\mathrm{.}26))$;

$//$ kdtree.insert $($new Point$2$D$(0\mathrm{.}70,0\mathrm{.}11))$;

$//$ kdtree.insert $($new Point$2$D$(0\mathrm{.}16,0\mathrm{.}01))$;

$//$ kdtree.insert $($new Point$2$D$(0\mathrm{.}62,0\mathrm{.}95))$;

$//$ kdtree.insert $($new Point$2$D$(0\mathrm{.}98,0\mathrm{.}04))$;

$//$ kdtree.insert $($new Point$2$D$(0\mathrm{.}87,0\mathrm{.}79))$;

$//$ kdtree.insert $($new Point$2$D$(0\mathrm{.}83,0\mathrm{.}21))$;

$//$ Point$2$D mid $=$ new Point$2$D $(0\mathrm{.}5,0\mathrm{.}5)$;

$//$ Point$2$D less $=$ new Point$2$D $(0\mathrm{.}5,0\mathrm{.}4)$;

$//$ Point$2$D more $=$ new Point$2$D $(0\mathrm{.}5,0\mathrm{.}6)$;

$//$ kdtree.insert $($mid$)$;

$//$ kdtree.insert $($less$)$;

$//$ kdtree.insert $($more$)$;

$//$ StdOut.println $($kdtree$.$contains $($less$))$;

$//$ StdOut.println $($kdtree$.$contains $($more$))$;

$//$ StdOut.println $($kdtree$.$range $($new RectHV $(0\mathrm{.}5,0\mathrm{.}4,0\mathrm{.}5,0\mathrm{.}6)))$;

$//$ StdOut.println $($kdtree$.$nearest $($less$))$;

$//$ StdOut.println $($kdtree$.$nearest $($more$))$;

StdOut.println $($kdtree$)$;

kdtree.toGraphviz $()$;

kdtree.draw $()$;

$\}$

$\}$