Given an array of integers, you need to find the length of the longest increasing subsequence $($LIS$)$ with the following constraints:The subsequence should consist of strictly increasing elements.No two consecutive elements in the subsequence should have a difference greater than K$.$Write a function or method to solve this problem efficiently.