Mark all the statements that are true

$$ If a regular graph has degree d$,$ then d is an eigen vector of the adjacency matrix of the graph

The Fiedler vector is the eizen vector corresponding to the smallest eigen value of Laplacian matrix of a graph

The adjacency matrix and the Laplacian matrix of a graph will have the same set of eigen vectors

The number of eigen vectors consisting of all ones, is equal to the number of connected components of the graph