Let L be a language defined as follows: L = { w | w ∈ {0,1}* && w does not have any 1s that are separated only by 2*n 0's where n ∈ ℕ\{0} } examples: "11", "101", "00", "010" are in L "1001", "10100001" are not in L Which of the following attempts to prove that L is a non-regular language provides a valid fooling set 'S' + algorithm to choose a distinguishing suffix for a pair of elements in S? For each of the following attempts, select the most specific answer from the respective drop-down. Attempt #1: S = { 1, 100, 10000, ...} = { 102m | m ∈ ℕ } ALG = " Given two elements from S 102i and 102j, where i < j, choose suffix 02i1 " Attempt #2: S = { 1, 10, 100, ...} = { 10m | m ∈ ℕ } ALG = " Given two elements from S 10i and 10j, where i < j: IF (i even and j odd || j even and i odd) -> Choose suffix "1" ELSE -> Choose suffix "0i1" " Attempt #3: S = { 0, 10, 100 } ALG = " Choose the suffix according to the following map of element pairings: (0,10) -> choose suffix "01" (0,100) -> choose suffix "1" (10,100) -> choose suffix "1" " 1: Attempt #1 2: Attempt #2 3: Attempt #3匹配题