Given an array of integers, change it in such a way that it follows a zig-zag pattern. A zig-zag array is one where for each integer, its adjacent integers are both greater than or less than itself. In other words, using L to mean a lower value and H to mean higher, the array follows either the pattern [L, H,L, H...] or [H, L,H, L...]. To make the array a zig-zag array, you can replace any element with any other integer (positive, negative, or zero). What is the minimum number of replacements required to accomplish this