$(15$ points$)$ Design an an algorithm that takes as input an undirected graph $G$ with vertex set $V=\{1,2,$dots,$n\}$ in its adjacency list representation along with two vertices $i,j,$ and outputs the list of all common neighbors of vertices i and $j.$ The running time of your algorithm should be $O(|V|+|E|).$ A vertex $k$ is a common neighbor of i and $j$ if both i and $j$ are adjacent to $k.$