Basic relational theory help

Consider relation schema R(A,B,C) and the set of functional dependencies
F={B->A,A->C}

1. All non-trivial relations. Is this correct? Im just guessing. B->A, A->C,B->C,AB->BC,AC->C, BC->CA,AB->C
2. Find a non-empty instsance of R(give a number of rows) that satisfies every Functional Dependency in F. Is this correct? A B C 2 1 3 3 2 4 4 3 5
3. Find an instance in R that satisfies every FD in F accept A->B

How do you get A->B???? I dont see it.