Write a function that gets an array of ints of length n, and a number k, and returns the longest subsequence of consecutive k’s in the array. For example - On input ([1, 1, 3, 3, 3, 1, 5, 1], 1), the function returns 3 - On input ([1, 3, 3, 2, 3, 3, 3, 3], 3), the function returns 4 - On input ([3, 5, 2, 5, 2, 5, 5], 3), the function returns 2 - On input ([1, 2, 3, 3, 3, 3], 5), the function returns 0 // returns the length of the longest subsequence // of consecutive k’s in the array int longest_seq(const int* ar, int n, int k);   test for the function: void test_q1() { inta1[] = {1, 1, 3, 3, 3, 1, 5, 1}; if (longest_seq(a1, 8, 1) == 2) printf("Q1-1 ok\n"); else printf("Q1-1 ERROR\n"); inta2[] = {1,3,3,2,3,3,3,3}; if (longest_seq(a2, 8, 3) == 4) printf("Q1-2 ok\n"); else printf("Q1-2 ERROR\n"); }

Write a function that gets an array of ints of length n, and a number k, and returns the longest subsequence of consecutive k’s in the array. For example

- On input ([1, 1, 3, 3, 3, 1, 5, 1], 1), the function returns 3

- On input ([1, 3, 3, 2, 3, 3, 3, 3], 3), the function returns 4

- On input ([3, 5, 2, 5, 2, 5, 5], 3), the function returns 2

- On input ([1, 2, 3, 3, 3, 3], 5), the function returns 0

// returns the length of the longest subsequence

// of consecutive k’s in the array

int longest_seq(const int* ar, int n, int k);

test for the function: