using C, im struggling to make linked-lists for the piles without using std::list.

1. The card game Each of players starts with cards arranged in a pile. These cands have value ..., with the card on the top. The weight of the pile is the sum of "y, where is the depth of each card (starting at l) and visi value. So the starting weight of each pile is 191 +242 + ... + =de1216 Higher weight piles are worse the goal is to have 0 weight, that is, no cards at all. At each turn, someone tosses ann-sided die, which indicates which player p will have the advantage on this turn. Player posses a 2-sided die, indicating whether to discard card from the top (if the die shows the bottom of its pile (if the die shows 2), and in-sided die, indicating which player accepts the discarded card. It is possible for p to get its own card back. The recipient puts the accepted card at the top of its p The winner is the first player to have an empty pile. If after turns, no player has won, then the player whose pile has the smallest weight wins. If there is a tie, the lowest-numbered player with the smallest wein 2. What to do Write a program called cards that simulates this card game. This program must take and I as command-line parameters. Make sure your program fails gently if any of these parameters is ridiculous, such as 0. The program also takes a stream of random numbers from standard input. The program must play the game until some player wins or turns have completed. After each turn, it prints which player sends a cand (top or bottom) to which recipient and the weight of each player's pile after the tum. When the game is over either because a player has to remaining cards or the number of turns has reached its limin, the program prints which player wins 1. The card game Each of n players starts with cards arranged in a pile. These cards have value with the card on the top. The weight of the pile is the sum of />, where is the depth of each card starting at l) and visits value. So the starting weight of each pile is 191 +22 + + de+1)(2016, Higher weight piles are worse; the goal is to have weight, that is, no cards at all. At each turn, someone to sesan -sided die, which indicates which player will have the advantage on this tum. Player Poses a 2-sided die, indicating whether to discard a card from the top of the die shows l) or the bottom of its pile (if the die shows 2), and an t-sided die, indicating which player accepts the discarded card. It is possible for p to get it on card back. The recipient puts the accepted card at the top of its pile. The winner is the first player to have an empty pile. If after turns, no player has won, then the player whose pile has the smallest weight wins. If there is a tie, the lowest-numbered player with the smallest weight wins 2. What to do Write a program called cards that simulate this card game. This program must taken, candras command-line parameters, Make sure your program fails ently if any of these parameters is ridiculous, such as 0. The program also takes a stream of random numbers from standard input. The program must play the game until some player wins or barns have completed. After each turn, it prints which player sends a card (top or bottom) to which recipient and the weight of each player's pile after the turn. When the game is over (either because a player has no remaining cards or the number of turns has reached its limit), the program prints which player wins 1. The card game Each of players starts with cards arranged in a pile. These cands have value ..., with the card on the top. The weight of the pile is the sum of "y, where is the depth of each card (starting at l) and visi value. So the starting weight of each pile is 191 +242 + ... + =de1216 Higher weight piles are worse the goal is to have 0 weight, that is, no cards at all. At each turn, someone tosses ann-sided die, which indicates which player p will have the advantage on this turn. Player posses a 2-sided die, indicating whether to discard card from the top (if the die shows the bottom of its pile (if the die shows 2), and in-sided die, indicating which player accepts the discarded card. It is possible for p to get its own card back. The recipient puts the accepted card at the top of its p The winner is the first player to have an empty pile. If after turns, no player has won, then the player whose pile has the smallest weight wins. If there is a tie, the lowest-numbered player with the smallest wein 2. What to do Write a program called cards that simulates this card game. This program must take and I as command-line parameters. Make sure your program fails gently if any of these parameters is ridiculous, such as 0. The program also takes a stream of random numbers from standard input. The program must play the game until some player wins or turns have completed. After each turn, it prints which player sends a cand (top or bottom) to which recipient and the weight of each player's pile after the tum. When the game is over either because a player has to remaining cards or the number of turns has reached its limin, the program prints which player wins 1. The card game Each of n players starts with cards arranged in a pile. These cards have value with the card on the top. The weight of the pile is the sum of />, where is the depth of each card starting at l) and visits value. So the starting weight of each pile is 191 +22 + + de+1)(2016, Higher weight piles are worse; the goal is to have weight, that is, no cards at all. At each turn, someone to sesan -sided die, which indicates which player will have the advantage on this tum. Player Poses a 2-sided die, indicating whether to discard a card from the top of the die shows l) or the bottom of its pile (if the die shows 2), and an t-sided die, indicating which player accepts the discarded card. It is possible for p to get it on card back. The recipient puts the accepted card at the top of its pile. The winner is the first player to have an empty pile. If after turns, no player has won, then the player whose pile has the smallest weight wins. If there is a tie, the lowest-numbered player with the smallest weight wins 2. What to do Write a program called cards that simulate this card game. This program must taken, candras command-line parameters, Make sure your program fails ently if any of these parameters is ridiculous, such as 0. The program also takes a stream of random numbers from standard input. The program must play the game until some player wins or barns have completed. After each turn, it prints which player sends a card (top or bottom) to which recipient and the weight of each player's pile after the turn. When the game is over (either because a player has no remaining cards or the number of turns has reached its limit), the program prints which player wins