The spider wants to walk to vertex (F), To get there it must follow these rules.1. The spider can walk only along edges2. The spider can walk along an edge, once only3. The spider can only go down the vertical edges, never up4. The spider can visit any vertex expect (F) more than once. When it gets to F, it must stop.One way to get to F. is S-A-B-F...how many other ways can u find?Please post the possible ways,too