Three married couples want to cross a river but the only available boat's capacity is two people and the husbands are so jealous that none will allow his wife to be around another man unless he is present too. Design an algorithm that will get the couples across the river. A Discussion Let wi designate the ith wife where I's value is 1.2 or 3. Let hi designate the ith husband where I's value is 1, 2 or 3. Let b designate the boat. 1. (b.h1.w1, h2,w2, h3, w31) -> (h1, h2, h3, w3|b, w1, W2) is a good crossing where the husbands and wife 3 are on the near side of the river and the boat, and wife 1 and wife 2 are on the far side of the river. 2. (b.h1,w1.h2, W2, h3, w31) -> (h1,w2.h3.w3|b, h2, wl) is a bad crossing because 3 wives are in the presence of other men without their husbands. 3. (b, h1,w1, h2, W2. h3,W31) -> (b, h1, h2|w1.w2) is an impossible crossing because no one can cross the river without a boat. However, an impossible crossing is not the same as an impossible. configuration. 4.(b, h1, h2w1,w2) is a possible configuration. The Task Write a series of possible crossings that move the couples from the near side of the river to the far side of the river