Answer to the Question no(1)

We realize that on the off chance that we need to include another hub toward the finish of a connected rundown, we need to include another hub through the last addition. I additionally realize that the location part of the last hub in a connected rundown is invalid.

Presently on the off chance that I need to embed another hub toward the finish of the connected rundown, I first need to make another hub and supplement information into the hub. At that point with the recently made hub, you need to interface the last hub with the invalid of the current connected rundown and invalid the location part of the new hub.

At that point another hub will be included as the last hub toward the finish of the connected rundown and invalid will be alloted to the location part.

Answer to the Question no (2)

There are three sorts of Linked List.

1.Singly Linked List

2.Doubly Linked List

3.Circular Linked List

Answer to the Question no (3)

A portion of the downsides in the connected rundown are referenced beneath:

1) It requires more space as pointers are additionally put away with data.

2) Different measure of time is needed to get to every component.

3) If we need to go to a specific component then we need to experience every one of those components that precede that component.

4) we can not navigate it from last and just from the earliest starting point.

5) It isn't anything but difficult to sort the components put away in the straight connected rundown.