Consider an array 𝐴 = [10, 7, 8, 19, 41, 35, 25, 31]. Suppose the merge sort…

Consider an array 𝐴 = [10, 7, 8, 19, 41, 35, 25, 31]. Suppose the merge sort algorithm is executed on array 𝐴 to sort it in increasing order. The merge sort algorithm will carry out a total of 7 merge operations. A merge operation on sorted left array 𝐿 and sorted right array 𝑅 is said to be void if the output of the merge operation is the elements of array 𝐿 followed by the elements of array 𝑅. The number of void merge operations among these 7 merge operations is __________. (answer in integer)