Q$13.1\mathrm{.}9)$ Bottom$-$up heap construction can be used to insert elements in $O(n)$ time instead

of $O(nlogn)$ time from a dynamic dataset. True or False? $[1$ point$]$

TRUE FALSE

Q$14.1\mathrm{.}10)$ Which of the following data structures you think is the most suitable fot the task

of checking whether you have encountered a particular object before during a process or

not? $[1$ point$]$

Stack

Queue

Binary Search Tree

Hashtable