Write a $C$ code that illustrates the following on the screen.

$(1)$ One integer $(2$ to $100)$ is input and the prime number is output,

$(2)$ From $2$ to $100,$ the prime number of integers is the solution,

$(3)$ Two integers from $1$ to $100$ are received, and the minimum common multiple of these integers is outpu

$(4)$ Two integers from $1$ to $100$ are received, and the maximum common divisor of these two integers is the solution

$(5)20,21,22,23,$dots the values up to $20$ are solvated,

Example of results: Red squares are entered by the user on the keyboard

$(1)$

CA Microsoft Visual Studio Debug Console

Input an integer $(2100)$: $31$

Prime

CA Microsoft Visual Studio Debug Console

Input an integer$(2100)51$

Non$-$prime

$(2)$

Microsoft Visual Studio Debug Console

$235711131719232931374143475359616771737983,8997$

$(3)$

Microsoft Visual Studio Debug Console

Input two integers$(1100$ : least common multiple: $24$

$(4)$

CA Microsoft Visual Studio Debug Console

Input two integers$(1100)$: $2464$ great common divisor: