Graph Coloring · Medium problem

A $4$-cycle $0,1,2,3$ (edges $01,12,23,30$) has one pendant device $4$ attached only to vertex $0$ ($5$ links in all). With $4$ colors available, in how many ways can all $5$ devices be properly colored?