Longest Increasing Subsequence II

You're given an integer array, nums, and an integer, k. Your task is to find the longest subsequence of nums that meets the following requirements:

1. The subsequence is strictly increasing.
2. The difference between adjacent elements in the subsequence is at most k.

Your function should print the length of the longest subsequence that meets these requirements.