Consider a social network where users can be friends with each other. Design a graph data structure to represent this social network, where each user is a node, and a directed edge from user A to user B represents a friendship from A to B. Additionally, each user has a numerical attribute representing their "friendship strength" with another user, which is a value between 1 and 10. Now, suppose you want to find the strongest connection between two users, i.e., the path with the highest cumulative friendship strength. Explain and illustrate (draw) how you would use an algorithm, such as Dijkstra's or Bellman-Ford, to find the path with the highest cumulative friendship strength between two given users in this social network graph. Provide an example with a graph and demonstrate the steps of the algorithm to find the path with the highest cumulative friendship strength