Algorithm 3: Prioritization of Safety and Non-Safety List (i.e., $L2\&L3$).

Input:$L2$ and $L3$

Output: $L4$ and $L5$ lists i.e., prioritize the list of safety and non-safety messages are sent to vehicles

1.   for $(i=1;i<=\mathrm{length}\mathrm{of}L2;i++)$

$L4=P{S}_i=D_i\ast S_i$

$Q1=P{S}_i$ // Q1 is the random list of L3.

2.   for $(i=1;i<=Q1.\mathrm{length};i++)$

Find min $Q{1}_i$

$L4=\min Q{1}_i$ // Build list $L4$ from minimum to maximum

End for

3.   Non-Safety for (j=1; j<=length of L3; j++)

$PN{S}_J=FCFS$

$L5=PN{S}_J$