Wow! This problem is kind of tricky. If you're ready to put your thinking cap on, brace yourself and good luck! Otherwise, you can skip it for now and return any time later!
The function closest_higher_mod_5 takes exactly one integer argument x and returns the smallest integer y such that:
- y is greater than or equal to x,
- y is divisible by 5.
Correct the last line of the code below to make the function work.
Tip: Try to think about how the variable remainder might be useful to you.
