In Java with a scanner only

Set Up: Let $p(n)$ represent the number of different ways in which $n$ coins can be separated into

piles. For example, five coins can be separated into piles in exactly seven different ways, so

$p(5)=7.$

Directions: Compute $p(n)$ for $1n10.$ Allow the user to choose integer $n.($Hint: Stirling

numbers$)$

Input: integer $n,$ the number of coins $($ie: $n=5)$

Output: integer $p(n),$ the number of ways that the coins can be separated into piles $($ie: $p(5)=7$

Warning: Don't use the asymptotic expression; instead, there exist recursive formulas $($where you

treat $p(n)$ as a sequence$).$

Notes: Implements the correct concept$/$formula$/$algorithm that the directions highlights. the program should run and compiles correctly. $.$ Be sure to correctly implement the type of input$/$output your code is supposed to use. Do not use menus or infinite loops to get information from the user.This includes error$-$checking user input with a while loop, or asking if the user wants to run the program again.