Looking for assistance with this question: Whenever they zig, you gotta zag def is_zigzag(n): A positive integer n is a zigzag number (also called an “alternating number” in some combinatorics...

Whenever they zig, you gotta zag

A positive integer n is a zigzag number (also called an “alternating number” in some combinatorics materials) if the series of differences between its consecutive digits read from left to right strictly alternates between positive and negative steps. The step from the 0irst digit to the second may be either positive or negative to start this dance. This function should determine whether its parameter n is a zigzag number.

In the negative examples in the table below, the part of the number that violates the zigzag property is highlighted in red.