PLS SOLVE BOTH $4$ and $5.$ PYTHON

Question $4[3$ points$]$: Write the recursive function layout$($num$),$ that displays $($prints$)$ the digits of num, one per line, first backward then forward. The left$-$most digit of num is printed only once. Do not use str$(),$ math module, lists of other structures to store digits of num, use $//$ and $\%$ only.

For this question, select the box that applies:

I checked my answer using the Python interpreter.

I completed it using an IDE first.

$$ I did not verify my answer in any way, but I am confident in my answer.

I struggled to complete the question.

Question $5[3$ points$]$: Implement the recursive function is$\_$prime$\_$helper that helps the is$\_$prime function below to determine if num $($an integer greater than $1)$ is prime. This helper function returns True if num is a prime number and False otherwise.