Power Functions

Two algorithms receive a list of numbers of length $n$ as input and then process it. You know that the complexity of the first algorithm is $n^{2}$, whereas the complexity of the second algorithm is $n^{2.5}$. Both algorithms received a list of $10000$ numbers, the first algorithm spent $0.5$ seconds on processing it. How much time did the second one spend? Give the answer in seconds.