Write a program to enter a natural number n and find all sphenic numbers from 1 to n using Linked List ADT with necessary functions and Linked List principle. Note: The size of stack is a constant...

Write a program to enter a natural number n and find all sphenic numbers from 1 to n using Linked List ADT with necessary functions and Linked List principle.
Note: The size of stack is a constant (size = 3) and to use Stack ADT, there should be three steps:
Step 1. Find and push every prime numbers that constitute a specific sphenic number in the stack.
Step 2. Pop out all numbers found in the stack and calculate the product of these 3 prime numbers.
Step 3. Display the result in the stack.