Given a newly powered on learning switch connected to hosts a and e. How many times does the switch flood during the following exchange?
a. a -> b
b. c -> a
c.c -> d
d. e->c