Let Account be a relation as shown.

Account
AccNo Balance
A1 5000
A2 5000
A3 10000
A4 15000
A5 18000

Consider the given SQL query.

SELECT AccNo FROM Account AS A
WHERE (SELECT COUNT(*) FROM Account AS B
WHERE A.Balance < B.Balance) >= (SELECT COUNT(*)
FROM Account AS C WHERE A.Balance > C.Balance)

The number of rows returned by the SQL query is __________ . (Answer in integer)

Consider an ER model with the entities $E_1(A_{11},A_{12},A_{13})$ and $E_2(A_{21},A_{22},A_{23})$, where, $A_{11},A_{12},A_{13}$ are the attributes of $E_1$, and $A_{21},A_{22},A_{23}$ are the attributes of $E_2$. Let $A_{22}$ be a multi-valued attribute. $A_{11}$ and $A_{21}$ are the primary keys of $E_1$ and $E_2$, respectively.

Let $R_{12}$ be a many-to-many relationship between $E_1$ and $E_2$. Participation of both $E_1$ and $E_2$ in $R_{12}$ is total.

The minimum number of relations required to convert the ER model into relational model (assuming there is no other functional dependency) where each relation is in third normal form (3NF) is __________ . (Answer in integer)

Let R(A,B,C,D,E) be a relational schema with functional dependency set $F=\{A\to BC,CD\to E,E\to A\}$.
Which of the following statements is correct?

In a relational database, a B+ Tree Index is to be constructed for a relation on a key field. In a B+ Tree, a Node Pointer points to a sub-tree and a Data Record Pointer points to a block of database records.

Let, Node size = 4096 bytes, Node Pointer size = 10 bytes, Search Key Field size = 11 bytes and Data Record Pointer size = 12 bytes.

The maximum number of Node Pointers that can be present in a non-leaf node of the B+ Tree is ________ . (Answer in integer)