solve it in c++/java/python add code output screenshot also

You are given an array of integers. The array may or may not follow a zigzag pattern, meaning that each integer's adjacent integers can be represented in both a higher or lower value than itself. A zigzag pattern can start with a low value or a high value. Your goal is to convert the given array into a zigzag pattern by replacing any element with any other integer (positive, negative, or zero). What is the minimum number of replacements required to achieve this? The output should be an integer denoting the minimum number of operations required to turn the array into a zigzag pattern. Notations: L denotes a lower value H denotes a higher value Example: Input: [1,2,3,4,5] Patterns: [1,2,L,4,L] [H,2,3,H,5] Output: 2 In the above example, the first zigzag pattern represents a lowhigh-low-high-low pattern and the second one represents a highlow-high-low-high pattern. To retrieve an array that follows the low-high-low-high-low pattern, both the 3 and the 5 need to be reduced to anv vat high-low-high-low-high pattern. To retrieve an array that follows the low-high-low-high-low pattern, both the 3 and the 5 need to be reduced to any value less than 2 and 4 respectively. To retrieve an array that follows the high-low-high-low-high pattern, the value 1 needs to be increased (to any value greater than 2) and the 4 needs to be decreased (to any value less than 3). In this case, creating either form of zigzag arrays takes a minimum of 2 replacements, which is the required final answer. Input Format: - The first line contains an integer, n, the number of elements in arr. - Each line i of the n subsequent lines (where 0i