LICPS

Problem Statement

LICPS Problem Description Given an array Arr of size N. Find the length of longest good subsequence S in it. The subsequence S is called good if it follows the following rules: S is sorted. This means that for all i and j where i<j and j<N, Arr[i] < Arr[j]. Every two elements in S should be Co prime. Note: Two elements A and B are called Co prime if there is no integer x where A is divisible by x and B is divisible by x. Complete the LICPS function in the editor below. It has the following parameter(s): Name: N, Type: INTEGER, Description: The size of the array. Name: Arr, Type: INTEGER ARRAY, Description: The elements of the array. Return: The function must return an INTEGER denoting the length of the longest good subsequence of integers that fulfill the conditions. Constraints 2 ≤ N ≤ 10 4 1 ≤ Arr[i] ≤ 10 3 Examples Input format for debugging: The first line contains an integer, N, denoting the number of elements in Arr. Each line i of the N subsequent lines (whe