You have two data.. each file is text file. Each row is eeddgg bbetween two notes separated by space..wwee wwill be analyzing two main e$-$commerce sellers who are preparing for their Black Friday sales. The two graphs represent two potential social connectivity among a sample of $10,000$ consumers in Cairo. $80\%$ of the consumer base are previous customers for the two retailers $(40\%$ for each$)$ and they are most likely going to shop with their favorite retailer that they have used in the past, while the remaining $20\%$ of customers are still undecided.

To simplify things, any node with an ID ending in $0-3$ is a previous customer for retailer A $,$ while any node with an ID ending in $4-7$ is a previous customer for retailer B$,$ and any node with an ID ending in $8$ or $9$ is undecided. Assume we have $10$ days before the black Friday, upon which everyone will shop at their chosen seller.

a$.$ Start with a simple diffusion process, where in every iteration, the undecided customers will pick the seller they will shop with based on the preference of the majority of their peers. During each iteration, proceed with the nodes in ascending order of their Node ID $($start with node $1,$ then node $2,$ etc.$).$ The previous customers of each seller don't change their votes, only the undecided ones do$.$ Majority means strictly more than half of the node friends are choosing a particular seller, ignoring the undecided nodes thus far. For ties, use an alternating assignment for seller A or $B($i$.$e$.$ the first tie you encounter, assign seller A $,$ the second tie, assign seller B$,$ third tie assign seller $A,$ etc.$).$ As you are proceeding in the iteration, use the updated values to make the decision $($i$.$e$.$ if you are processing node $10,$ use all the decisions that were updated thus far for nodes $1-9).$

After running the $10$ iterations on each graph, illustrate the seller that had the highest number of customers in each network, and the margin by which it exceeds the other seller $($in number of customers$)$

b$.$ Seller A decides to throw money into TV ads to try to gain more customers, however only $1\%$ of the customer base watch TV nowadays $($assume they are nodes $3000-3099).$ For each $$1000$ spent, $10$ customers for this cohort actually gets convinced and go with seller A $($so for the first $$1000,$ seller $A$ is able to acquire customers $3000-3009,$ for the $$2000,$ it is able to acquire customers $3000-3019,$ etc. Once the customer is persuaded through the TV ad$,$ they no longer change their mind. Note that these customers who are exposed to the ad will go with seller A irrespective of their prior choice $($even if they were previous customers for seller B$)$

Simulate the effect of different advertising budgets $(b=$$$1000$ to $$9000)$ spent prior to the diffusion process. Plot two graphs for the two networks showing the budget spent on the x $-$axis, and the margin for seller A on the $y-$axis $($number of customers going with A $-$ number of customers going with B after the $10-$day iterations$).$ What is the minimum spend needed to have seller $A$ be the one ending with the higher number of customers on black Friday for each network?

c$.$ Seller A has another idea to utilize the graph structure rather than blanket TV ads, so it decides to spend the $$9000$ in online ads targeting the customers with the highest centrality. So$,$ the first $$1000$ will go to target an ad for the highest centrality node, the second $$1000$ will go to the second highest centrality, etc. In case of ties $($two nodes with the same centrality$),$ the node with the lower ID will be chosen first. Once the customer is targeted, they switch to A irrespective of their prior choice, and never switch back.

Simulate the effect of different advertising budgets $(b=$$$1000$ to $$9000)$ for targeting customers with highest degree centrality in one scenario, and highest betweenness in another scenario. Plot the same graphs for degree and betweenness centrality choices on both networks and determine the min spend in each case