Concept:
A relation is in 3NF for every functional dependency if X -> A and one of the following condition holds true .
1) X is a superkey or
2) A is a prime attribute.
Explanation:
E1 has attributes a11 and a12. a11 is the primary key.
Entity E2 has attributes a21 and a22 where a21 is the primary key.
Entity E3 has attributes a31 and a32 where a31 is the primary key.
R12 is many to many relationship between E1 and E2. So, R12 contains attributes a11 and a21.
R13 is a one to many relationship between E1 and E3. R13 contains attributes a11 and a31
In this we have 5 tables 3 for three entities and 2 for two relation.
But we have to find minimum number of tables or relations considering if all the relations are in 3 NF.
Here, we have to keep a separate table for R12 because if we combine it with any other relation it will violates 1 NF and hence 3NF. Because it will contain composite key since it is a many to many relation.
But we can combine relation R13 with entity E3.
R13E3 (a11, a31, a32)
It will not violates 3 NF . Because here a11, a31, a32 is the key. Here, it will not create any partial dependency. Hence it satisifies 3NF.
So, minimum 4 relations are required here.