Please could I get this in Java.

Part A Sections Detailed

Section 1:

Add your section comment to the code.

Create a string array and fill it with the profession names given in the provided code example.

Create a set and load it from the array.

Create a sorted set and load it from the first set.

On a new line print *********** Section: 1 ***********

On a new line, print Original List: to the console.

On a new line, print the contents of the unsorted set.

On a new line, print Sorted List: to the console.

On a new line, print the contents of the sorted list.

Section 2:

Add your section comment to the code.

Create a linked list structure named books and load it with the titles and in the same order as the example code provided.

Print a blank line.

On a new line print *********** Section: 2 ***********

On a new line, print Original Book List:

On a new line, print the contents of the linked list.

Sort the linked list alphabetically.

On a new line, print Sorted Book List:

On a new line, print the contents of the linked list.

Remove the second item from the list.

Sort the list then remove the first and last elements from the list.

Remove the last item from the list.

On a new line, print Book List After Deletions:

On a new line, print the contents of the linked list.

On a new line, print The number of items in my book list is: followed by the total number of items in the list.

Determine if the title, Brave New World, can be found in the list and print on a new line whether it exists in the current list.

Section 3:

Add your section comment to the code.

Create a class called Node which can represent a node in a binary tree.

Create a BinaryTree class.

Add an insert method to the BinaryTree class to insert new values.

Add a traverse method to the BinaryTree class to traverse the tree in order and print each nodes value.

Define a new instance of BinaryTree called myBinaryTree.

Use the insert method to add the following values, 50, 30, 45,12, 29.

Print a blank line.

On a new line print *********** Section 3 ***********

On a new line, print to the console, The contents of the binary tree are:

Use the traverse method to print the contents of the binary tree.