ISRO CS 2018: MiniMock Quiz-6

Consider the following statements about Dijkstra’s algorithm.
1. Dijkstra’s algorithm produces an incorrect result only if the graph contains a negative weight cycle.
2. If a graph contains a negative weight cycle, then Dijkstra's algorithm may not terminate.
Which of the above statements is true?

The output of the following program is
main()
{
     static int x[ ] = {1,2,3,4,5,6,7,8);
     int i;
     for(i=2;i<6;++i)  
     x[x[i]]=x[i]
     for(i=0;i<8;++i)
     printf(“%d”,x[i]);
}