15.4-1 Determine an LCS of 1,0,0,1,0,1,0,1 and 0,1,0,1,1,0,1,1,0. 15.42 Give pseudocode to reconstruct an LCS from the completed c table and the original sequences X=x1,x2,,xm and Y=y1,y2,,yn in O(m+n) time, without using the b table. 15.43 Give a memoized version of LCS-LENGTH that runs in O(mn) time. 15.44 Show how to compute the length of an LCS using only 2min(m,n) entries in the c table plus O(1) additional space. Then show how to do the same thing, but using min(m,n) entries plus O(1) additional space. 15.4-1 Determine an LCS of 1,0,0,1,0,1,0,1 and 0,1,0,1,1,0,1,1,0. 15.42 Give pseudocode to reconstruct an LCS from the completed c table and the original sequences X=x1,x2,,xm and Y=y1,y2,,yn in O(m+n) time, without using the b table. 15.43 Give a memoized version of LCS-LENGTH that runs in O(mn) time. 15.44 Show how to compute the length of an LCS using only 2min(m,n) entries in the c table plus O(1) additional space. Then show how to do the same thing, but using min(m,n) entries plus O(1) additional space