We are given an array A consisting of N distinct integers. We would like to sort array A into ascending order using a simple algorithm First, we divide it into one or more slices (a slice is a contiguous subarray). Then we sort each slice. After that, we join the sorted slices in the same order. Write a function solution that returns the maximum number of slices for which the algorithm will return a correctly sorted array,