Please read the following table in Markdown format and then answer the question according to the table. Table cells in one row are seperated by '|', and different rows are seperated by '
'.

Table:
| Operation | Binary | Binomial | Fibonacci | Pairing | Brodal *** | Strict Fibonacci Heap |
| --- | --- | --- | --- | --- | --- | --- |
| find-min | Θ(1) | Θ(1) | Θ(1) | Θ(1) | Θ(1) | Θ(1) |
| delete-min | Θ(log n) | Θ(log n) | O(log n)* | O(log n)* | O(log n) | O(log n) |
| insert | Θ(log n) | O(log n) | Θ(1) | Θ(1) | Θ(1) | Θ(1) |
| decrease-key | Θ(log n) | Θ(log n) | Θ(1)* | O(log n)* | Θ(1) | Θ(1) |
| merge | Θ(n) | O(log n)** | Θ(1) | Θ(1) | Θ(1) | Θ(1) |
Question:
Binomial of θ(log n), and a Strict Fibonacci Heap of o(log n) is what operation?
Answer:
delete-min