Let G$=($V$,$E$)$ be a directed graph, with positive edge weights. You are also given a vertex w$.$ Design an algorithm that outputs the set of vertices satisfying:d$($x$,$w$)>=2023.$d$($w$,$x$).$ Here, d$($y$,$z$)$ is the distance from vertex y to vertex z $($this is the length of the shortest path from y to z$)$