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 i not one or more slices( a slice is a contigious subarray) then we sort each slice after that, we join the sorted slice 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.

need answer in java.