You must write and run a program in JAVA to implement merged stacks by linked lists, you must solve the sections in the code and add to each implementation a description of the algorithm, an explanation of correctness, and a complexity analysis.

A mergeable heap supports the following operations: HEAP$-$MAKE $($which creates an empty mergeable heap$),$ INSERT, MINIMUM, MIN$-$EXTRACT, and UNION.

Show how merged stacks can be realized by linked lists in each of the cases below. Try to realize every action with maximum efficiency. Analyze the runtime of each operation in terms of the size of the dynamic group $($or groups$)$ on which the operations are performed.

A$.$ The lists are sorted.

B$.$ The lists are not sorted.

third. The lists are unsorted, and the dynamic groups to be merged are foreign.

Input format:

You must ask what the desired implementation is $($sorted$/$unsorted$/$foreign lists$)$ and enable the construction of a stack from a file.

The course of the program:

You must enable the actions described in the question.

Output format:

You must enable stack printing to the screen.

Beyond the code solution, you must describe in the accompanying document how all the algorithms you implemented with time analysis and running examples work.

Added stack sort operation.