Given an array of n integers, where each element represents the maximum number of steps that can be made forward from that element, write an algorithm to find the minimum number of jumps required to reach the end of the array $($starting from the first element$).$ If an element is $0$