Goldbach's Conjecture is one of the oldest and best$-$known unsolved problems in number theory and all

of mathematics. It states that every even integer greater than $2$ can be expressed as the sum of two

primes. A prime number $($or simply a prime$)$ is a natural number greater than $1$ that cannot be formed

by multiplying two smaller natural numbers. The conjecture has been shown to hold for all integers less

than $4\backslash$times $1018,$ but remains unproven despite considerable effort.

Test Goldbach's Conjecture for all integers less than $100.$ For each integer, print out a single line showing

how two primes can sum to the integer. For example:

$4=2+2$

$6=3+3$

$8=3+5$

$...$ etc.

Remember, $1$ is not prime.

Record a three minute video in which you run the code. Then, present your code. Specifically, answer

the following questions:

$$ Highlight the main loop in which you iterate over the integers $4$ through $100.$

$$ Show how you checked whether an integer is a prime.

$$ Explain the $($nested$?)$ loop in which you find two primes to sum to the integer.

Submission: Submit a single $.$py file containing all the code to the D$2$L$.$ Do not zip or archive the file.

Your code must include comments at the top including your name, date, video link, and the honor

statement, $$I have not given or received any unauthorized assistance on this assignment.$$ Each

function must include a docstring and be commented appropriately.