 As long as the number of families that a member can belong to is known at compile time, internal storage works fine.If, however, a member needed to be included in an arbitrary number of families, with the specific number known only at run time, external storage would be necessary.Finding a specific element in a linked list, even if it is sorted, normally requires O("n") time (linear search).