The total cost of retrieving records in sorted order using an unclustered B+ tree is
(P-Average number of records per data page
N-Data pages
F-Ratio of the size of a data entry to the size of a data record)
1
(F*N) + P
2
(F + P) * N
3
F*N*P
4
F + P/N