Write a function, to be included in a sorted linked list class, called printPosition, that will receive a parameter and print its position within the list ( position 1 if first, position 2 if second...). If the item is not in the list, specify it in a printing. Consider efficiency.

Computer science. Correct answer will be upvoted else downvoted.     Development of the exhibit in William's cell machine happens iteratively in the accompanying manner:    In the event that the component is dead and it has precisely 1 alive neighbor in the present status of the exhibit, then, at that point, on the following emphasis it will become alive. For a component at list I the neighbors would be components with files i−1 and i+1. In case there is no component at that list, it is viewed as a dead neighbor.    William is a sympathetic individual so all alive components stay alive.    Check the note area for instances of the advancement.    You are given some underlying condition, everything being equal, and you really wanted to help William discover the condition of the cluster after m emphasess of advancement.    Input    Each test contains various experiments. The principal line contains the number of experiments t (1≤t≤103). Depiction of the experiments follows.    The primary…

Write a function, to be included in a sorted linked list class, called printPosition, that will receive a T parameter and print its position within the list ( position 1 if in first node, position 2 if in second…). If the item is not in the list, specify it in a printing. Consider efficiency.