n=3: trees=3, states checked (Lemma 2.3) = 12; literal walk == aux walk (Lemma 2.4) for every tree and i: yes; (n-1)*P(tau=i) == brute force E N_i: yes
   E N_i = 2:2/3, 3:2/3, 4:2/3
   sum E N_i = 2 (n-1=2), sum i E N_i = 6 (n(n-1)=6)
   Remark 2.6: E N_2 = 2/3 vs (n-1)/n = 2/3: True; E N_3 = 2/3 vs formula 2/3: True
n=4: trees=16, states checked (Lemma 2.3) = 468; literal walk == aux walk (Lemma 2.4) for every tree and i: yes; (n-1)*P(tau=i) == brute force E N_i: yes
   E N_i = 2:3/4, 3:21/32, 4:33/64, 5:27/64, 6:3/8, 7:9/64, 8:9/64
   sum E N_i = 3 (n-1=3), sum i E N_i = 12 (n(n-1)=12)
   Remark 2.6: E N_2 = 3/4 vs (n-1)/n = 3/4: True; E N_3 = 21/32 vs formula 21/32: True
n=5: trees=125, states checked (Lemma 2.3) = 176600; literal walk == aux walk (Lemma 2.4) for every tree and i: yes; (n-1)*P(tau=i) == brute force E N_i: yes
   E N_i = 2:4/5, 3:52/75, 4:72/125, 5:1624/3375, 6:1346/3375, 7:1048/3375, 8:32/125, 9:193/1125, 10:92/675, 11:283/3375, 12:184/3375, 13:64/3375, 14:64/3375
   sum E N_i = 4 (n-1=4), sum i E N_i = 20 (n(n-1)=20)
   Remark 2.6: E N_2 = 4/5 vs (n-1)/n = 4/5: True; E N_3 = 52/75 vs formula 52/75: True
n=3: E C = 4/3 (2-2/n = 4/3: True); E D_2 = 2/3 (3(n-1)(n-2)/n^2 = 2/3: True)
n=4: E C = 3/2 (2-2/n = 3/2: True); E D_2 = 9/8 (3(n-1)(n-2)/n^2 = 9/8: True)
n=5: E C = 8/5 (2-2/n = 8/5: True); E D_2 = 36/25 (3(n-1)(n-2)/n^2 = 36/25: True)
n=6: E C = 5/3 (2-2/n = 5/3: True); E D_2 = 5/3 (3(n-1)(n-2)/n^2 = 5/3: True)
n=7: E C = 12/7 (2-2/n = 12/7: True); E D_2 = 90/49 (3(n-1)(n-2)/n^2 = 90/49: True)
n=8: E C = 7/4 (2-2/n = 7/4: True); E D_2 = 63/32 (3(n-1)(n-2)/n^2 = 63/32: True)
