Given an array of integers, change it in such a way that it follows a zig-zag pattern. A zig-zag array is an array where for each integer, its adjacent integers are both greater than or less than itself. In other words, for each valid i, (arr[i] > arr[i+1] and arr[i] > arr[i-1]) or (arr[i] < arr[i+1] and arr[i] < arr[i-1]). To make the array a zig-zag array, you can perform the following operation: replace any element with any other integer (positive, negative, or zero). What is the minimum number of operations required to accomplish this?

How to write JAVA Code for this?