Note: All programs must use the appropriate C$++$ features.

Objective:

The task is to refactor an existing C$++$ implementation of a Skip List data structure, which is

discussed in the lecture. The supplied code uses raw pointers and is not generic. You need

to convert this code to use smart pointers and template classes to support any data type,

enhancing safety and flexibility.

Tasks:

Implement Templating: Convert the Skip List and Node classes to template classes to

allow for generic data types.

Memory Management: Replace all raw pointers in the code with appropriate smart

pointers.

Code Integration: Integrate your program's core functionalities ensuring they align

with the provided main function. This setup should demonstrate your program's

capabilities effectively.

Expected Output: Utilize the supplied main function to validate that your program

generates the expected output accurately. This step is crucial for verifying the

correct implementation of functionalities such as insertion, deletion, search, and

display within your Skip List.

Input:

Utilize the supplied main function to validate that your program generates the expected

output accurately. Must not change the main function. The skip list used in the main

function comes from the lecture, like below: