Please sumbit as soon as possible. Please implement all four required functions according to rules.

import java.io$.*$;

import java.util.$*$;

public class Lab$6$

$\{$

$/**$

$*$ Problem $1$: Determine the number of nodes based on their number of children.

Iterative Solution

$*/$

private static int$[]$ problem$1$Iterative$($Node root$)$

$\{$

$//$ Implement me$!$

return new int$[]\{$

$-1,//$ nodes with $0$ children

$-1,//$ nodes with $1$ child

$-1//$ nodes with $2$ children

$\}$;

$\}$

$/**$

$*$ Problem $1$: Determine the number of nodes based on their number of children.

Recursive Solution

$*/$

private static int$[]$ problem$1$Recursive$($Node root$)$

$\{$

$//$ Implement me$!$

return new int$[]\{$

$-1,//$ nodes with $0$ children

$-1,//$ nodes with $1$ child

$-1//$ nodes with $2$ children

$\}$;

$\}$

$/**$

$*$ Problem $2$: Determine the maximum distance from the root to a leaf.

Iterative Solution

$*/$

private static int problem$2$Iterative$($Node root$)$

$\{$

$//$ Implement me$!$

return $0$;

$\}$

$/**$

$*$ Problem $2$: Determine the maximum distance from the root to a leaf.

Recursive Solution

$*/$

private static int problem$2$Recursive$($Node root$)$

$\{$

$//$ Implement me$!$

return $-1$;

$\}$

$//---------------------------------------------------------------------$

$//$ Do not change any of the code below!

static class Node

$\{$

public int value;

public Node left;

public Node right;

$\}$

private static final int LabNo $=6$;

solution.length$)$ return false;

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

$\{$

if $($answer$[$i$]!=$ solution$[$i$])$ return false;

$\}$

return true;

$\}$

private static boolean testProblem$2($int$[][]$ testCase, int style$)$

$1$; i noOfLines; i$++)$

$\{$

boolean passed $=$ false;

boolean exce $=$ false;

int$[][]$ testCase $=$ null;

try

$\{$

switch $($prob$)$

$\{$

case $1$:

testCase $=$ createProblem$1($i$)$;

passed $=$ testProblem$1($testCase$,$ style$)$;

break;