1. {a,n,d,r,e,a}
5^100 total possible rearrangements of alphabet
2 vowels {a,e}
3 consonants {n,d,r}
(i) 5^100/(2!3!) = 6.57384088×10^68
(ii) 5^100/(2!3!) = 6.57384088×10^68
(iii)5^100/(2!3!2!3!) = 5.47820073×10^67


2. 
farmer=1,wolf=2,sheep=3,cabbage=4,endpoint=5
possible edges: 12,13,14,15,25,35,45,24,51,52,53,54
G:={2,3,4,5},{4,5},{5},{5},{1,2,3,4}
Using "Paths"
135,51,125,531,145,51,135
farmer brings sheep across
farmer comes back
farmer brings wolf across
farmer brings sheep back
farmer brings cabbage across
farmer comes back
farmer brings sheep across


4.
M1=1,M2=2,M3=3,C1=4,C2=5,C3=6,endpoint=7
not sure how to use maple procedure to solve problem because graph would have to be a weighted graph, in order to keep track of how many missionaries and how many cannibals have crossed the river?