Help Beibei and Xiaoyu with their snail race game. Determine which snail to race in each round for optimal strategy.
Alice and Bob participate in a snail race game, each owning 3 snails with different speeds: slow (s), medium (m), and fast (f). Alice has come up with a specific strategy: 1. **Round 1**: Alice plays with her slowest snail against Bob’s fastest snail. 2. **Round 2**: Alice's medium-speed snail competes with Bob’s slowest snail. 3. **Round 3**: Alice's fastest snail races against Bob’s medium-speed snail. Write a function to determine if Alice's strategy results in a win, i.e., she wins 2 or 3 out of the 3 rounds. ### Parameters - `alice_snails`: A list of Alice's snails' speeds in the sequence `[s, m, f]`. - `bob_snails`: A list of Bob's snails' speeds in the sequence `[s, m, f]`. ### Return Value - The function should return `True` if Alice’s strategy results in 2 or 3 victories. - It should return `False` otherwise. ### Examples ```python snail_race([3, 5, 10], [4, 7, 11]) # True # By following the race sequence (3,11), (5,4) and (10,7), Alice wins two rounds. snail_race([6, 8, 9], [7, 12, 14]) # False # Following the race sequence (6,14), (8,7) and (9,12), Bob wins two rounds. snail_race([1, 8, 20], [2, 9, 100]) # True ```