Consider the sequence: 4,8,3, 9, 1,6,2,5,13,8,10,7 You have to find longest increasing subsequence of this sequence. @ Define the function L(.) you will be computing Give recursive formula for LE tabulation, o Compute L(6) by Compute also the helpful lihts, @ Use La HH to find. LIS 4 Consider "edge list". For the Igraph shown here, here is its ge list: representation of I graphs 2 36 hu 7 1,5, 2, 6, 3, 2, 1, 2, 6, 1, 0, 4,7 (each edge is witten as a after all pair; edges, there is a, and then list of verts with degree o). @ If graph G has V routs e E elgos, mamy calls does etge list need? Write prendo cade for computing the given vortex x. What is the complexity of your cade? @ What's the complexity of checking Julher vertices it j are | Find min. tree If this graph 02-24 using Prim's or Kruskal's Algo (your choice). | Show each iteration carefully, list candidate elges, and if vtx labels. spanning que its weight. Consider a function (uj) girem by (31-2jl if ialar M(ij)= M(ij-D othermise 6 Spanning 59 10 tru kei (6) Conster a function (uj) 13 - 2jl if iola M(ij)= - + kai M M(ij-1) othermise