Question#2. Consider the following output examples for answering the following questions [20 pints]:

Example 1:

Enter a numerical ascending list and a number to insert: 1256 4

The new list is 12456

Example 2:

Enter a numerical ascending list and a number to insert: 1256 8

The new list is 12568

Example 3:

Enter a numerical ascending list and a number to insert: 2567 1

The new list is 12567

Example 4:

Enter a numerical ascending list and a number to insert:

1356 6

No changes because 6 exist in the list

a) Write ONLY a main and recursive method called (insertNumber) that inserts a number in a list of ascending numbers and reserves the list order. The insert operation performs if the given number doesnt exist previously in the list. [15 points]. (THE CODE MUST BE IN JAVA)

b) Trace the execution of insertNumber using example 1 and example 4, which are shown above [5 points]. (PLEASE MAKE A TABLE FOR EACH ITERATION)

solve part A and B