in java, the first recursive method that you are required to write solves the following problem:

Given a value N$,$ return the total number of partitions for that value N$.$

PartitionCalculator.java needs a method with the signature below:

public static int numOfPartitions$($int N$)$

For example if we call numOfPartitions$(5),$ the return value is $7($as there are only $7$ unique

partitions of $5)$:

$1.[5]$

$2.[4,1][1,4]$

$3.[3,2][2,3]$

$4.[3,1,1][1,3,1][1,1,3]$

$5.[2,2,1][2,1,2][1,2,2]$

$6.[2,1,1,1][1,2,1,1][1,1,2,1][1,1,1,2]$

$7.[1,1,1,1,1]$