Consider the following topological sorting algorithm Algorithm: Topological Sorting: procedure topological sort (S: finite poset) k: = 1 while S notequalto begin a_k: = a minimal elements of S S: = S-{a_k} k++ end (a_1, a_2, ...a_n) is a compatible total ordering of S Apply the topological sorting algorithm to the posets given above and give a sequence in which the elements of the set are chosen. Do the same for the set S and relation Rbelow: S = {1, 2, 3, 4} and R = {(1, 1), (2, 2), (3, 3), (4, 4), (1, 3), (2, 4), (4, 3), (2, 3)}