Find the longest increasing subsequence in an array Write a function that takes a built-in array...

Transcribed Image Text:

Find the longest increasing subsequence in an array Write a function that takes a built-in array as an input and finds the longest increasing subsequence of that array. Write a driver program to test your function by asking the user to input 10 digits and output the longest increasing subsequence of those. Input: [1, 2, 3, 5, 3, 1, 7, 10, 6, 31] Output: [1, 2, 3, 5] Find the longest increasing subsequence in an array Write a function that takes a built-in array as an input and finds the longest increasing subsequence of that array. Write a driver program to test your function by asking the user to input 10 digits and output the longest increasing subsequence of those. Input: [1, 2, 3, 5, 3, 1, 7, 10, 6, 31] Output: [1, 2, 3, 5]