Visit node c: Since the cut orientation is vertical;

L = {(4, 4), (6, 3), (7, 2)}

R = {(2, 7), (3, 5), (4, 3)}
Note that we obtained R from reversing the order we computed for b
earlier.
(i) Join l 1 = (4, 4) and r 1 = (2, 7): we get (4 + 2, max{4, 7}) =
(6, 7). Since the maximum is from R, we join l 1 and r 2 next.
(ii) Join l 1 = (4, 4) and r 2 = (3, 5): we get (4 + 3, max{4, 5}) =
(7, 5). Since the maximum is from R, we join l 1 and r 3 next.
(iii) Join l 1 = (4, 4) and r 2 = (4, 3): we get (4 + 4, max{4, 3}) =
(8, 4). Since the maximum is from L, we join l 2 and r 3 next.
(iv) Join l 2 = (6, 3) and r 3 = (4, 3): we get (6 + 4, max{3, 3}) =
(10, 3). Since the maximum is from R (and L), we reach the end
of R and thus terminate.
Thus, the resulting dimensions are {(6, 7), (7, 5), (8, 4), (10, 3)}.
(d) Visit node d: Since the cut orientation is vertical;
L = {(6, 7), (7, 5), (8, 4), (10, 3)}
R = {(3, 5)(5, 3)}
(i) Join l 1 = (6, 7) and r 1 = (3, 5): we get (6 + 3, max{7, 5}) =
(9, 7). Since the maximum is from L, we join l 2 and r 1 next.
(ii) Join l 2 = (7, 5) and r 1 = (3, 5): we get (7 + 3, max{5, 5}) =
(10, 5). Since the maximum is from both L and R, we join l 3 and
r 2 next.
(iii) Join l 3 = (8, 4) and r 2 = (5, 3): we get (8 + 5, max{4, 3}) =
(13, 4). Since the maximum is from L, we join l 4 and r 2 next.