(13%) Now you are given a weighted graph $G=(V, E)$, a specified vertex s in V, an array $d[\,]$ of size $|V|$, and it is claimed that for each v in V, $d[v]$ is the length of the shortest path from s to v. The claim may be correct or may not be. Design a linear time algorithm to check whether the claim is correct. Analyses the time complexity of your algorithm and make sure it is linear, that is, the running time of your algorithm must be $O(|V|+|E|)$.