Programming

$30.(8$ pts$)$ In the space below, write a function called maxIncCount in OCam$\frac{l}{F}$#$,$ which :

Accepts a predicate function and a single list of integers. $($You may assume the list has at least one element.$)$

Resolves to a integer count of the longest consecutive sequence of increasing integers matching the predicate.

The function should utilize pattern matching and recursion and not use any "mutable" values$/$variables$.$

For example, the result would equal $3$ after the function call below:

let result $=$ maxIncCount $($fun $xx>0$

Reason: The $3$ consecutive values $2$;$4$;$6$ represent the longest run of integers greater than $0.$