Consider the method insertInOrder, as given in Segment 8.11, that inserts an object into i...

Consider the method insertInOrder, as given in Segment 8.11, that inserts an object into its correct position within a sorted portion of an array. If we were to use a similar algorithm to insert a node into a sorted chain of linked nodes, we would begin at the end of the chain. For example, to insert a node containing 6 into the chain shown in Figure 2, we first would compare 6 with the integer 10. Since 6 belongs before 10, we would then compare 6 with 8. Since 6 belongs before 8, we compare 6 with 5 and discover that 6 belongs between 5 and 8.

Describe how you could use this algorithm to define a method insertInOrder for a sorted chain of linked nodes.

FIGURE 2 A chain of integers sorted into ascending order