We’re asked to analyse the asymptotic cost and delay of our implementation of \mathrm{PF}(n)?
We haven’t covered this in class. What do we do?
For the time being, till you cover asymptotics in the recitations, you may look at the number of gates of each type in \mathrm{PF}(n) and analyse how these numbers change with n.