# Sorting n element using Fibonacci Heap

How can I design a sorting algorithm of n elements using a Fibonacci Heap?

Will it be a flavoured version of heap-sort where I replace the heap data-structure with Fibonacci Heap?

And, remember, for comparison based sorting algorithm, we have $$\Omega(n \log n)$$ as lower bound.