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. 
 A P Only B Q Only C Both P and Q D Neither P nor Q

Finds whether any negative weighted cycle is reachable from the source