Truth-Trees in Polyadic QL

Test the following arguments for validity:

1. (∃x)Lfx, (x)(Lfx ⊃ Lfm) ///Lfm

2. (∃x)Axa  /// Aaa

3. (∃y)Lay & (∃y)Lby  /// (∃y)(Lay & Lby)

4. (∃y)(x)Lxy /// (x)(∃y)Lxy

5. (x)Lfx, (x)(Lfx ⊃ Lfm) /// Lfm

6. (∃x)(y)(Fxy ⊃ Gxy), (y)Fay  /// (∃y)Gay

7. (∃x)(∃y)Sxy ⊃ (x)(y)Txy, (∃x)(∃y)~Txy /// (∃x)(∃y)~Sxy

8. Hab /// (x)(∃y)Hxy

9. (x)((Wx v Cx) ⊃ Eax) /// (x)(Wx ⊃ Eax)

10. (x)(y)(Axy ⊃ Bx), (x)(y)(Bx ⊃ Cxy) /// (x)~(∃y)~(Cxy ⊃ Axy)