The DP-coloring analogue of Shannon's bound for line graphs

Let $G$ be a loopless multigraph, let $\Delta(G)$ denote its maximum degree, and let $\mathsf{Line}(G)$ be the simple graph whose vertices are the edges of $G$, with adjacency when the corresponding edges share an endpoint. Let $\chi_{DP}$ denote the DP-chromatic number. Line-graph Shannon conjecture. For every multigraph $G$, \

\chi_{DP}(\mathsf{Line}(G))\leqslant\frac{3\Delta(G)}{2}. \

This conjecture proposes that Shannon's bound for the chromatic index of multigraphs extends to DP-coloring of line graphs, despite failing for line multigraphs. The source does not state a resolution.