Which of the following statement(s) is / are correct regarding Bellman-Ford shortest path algorithm?
P: Always finds a negative weighted cycle, if one exist s.
Q: Finds whether any negative weighted cycle is reachable from the source.

Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap?

What is the number of swaps required to sort n elements using selection sort, in the worst case?

Consider a binary max-heap implemented using an array. What is the content of the array {25, 14, 16, 13, 10, 8, 12} after two delete operations?