(e) Consider root: the root of a binary search tree (BST) storing positive integer numbers greater than 0 N : the number of nodes in the BST rooted at root floor (x) : returns the largest integer smaller than or equal to x. function F3 (root, N) if(N==0): return -1 A= new array (N) of zeroes Q= new Queue() ENQUEUE(Q,root) while !ISEMPTY (Q) x=PEEK(Q) A[0]=x data i=0 while A[i]>A[i+1] and i<1>