Suppose we have 10 elements in a set. we begin with all the elements in their singleton sets. consider the following sequence of operations: a. union(1,2) /* assume that 1 is the root */b. m = find(1)c. union(3,4) /*assume that 3 is the root */d. n = find(4)e. union(m, n)f. m = find(1)g. union(m,5)h. union(6,7) /*assume that 6 is the root */i. m = find(6)j. union(m,8)k. union(9,10) /*assume that 9 is the root */l. m = find(10)m. n = find(4)n. n = find(2)o. union(m, n)p. m = find(10)q. n = find(8)r. union(m, n)show the resulting trees after steps e, g, j, o, r for the following two strategies: i. union by sizeii. union by size and path compression

Jaina and tomas are being considered as new tenants in an apartment. the landlord looks at their creditworthiness because he wants to be sure his new tenant pays the rent on time and in full. the table below summarizes the information that was on their applications. application information questions jaina tomas how many years have you had your job? 5 2 what is your monthly salary? $1,850 $2,500 how many credit cards do you have? 4 1 how much debt do you have? $13,000 $7,000 how many times were you late with payments on credit cards in the past year? 5 1 who will the landlord decide to be more creditworthy and why? tomas because the ratio of his debt to income is less. jaina because she has had her job longer, which makes her look more stable. jaina because she has more credit cards available to her. tomas because he makes more money per month.