
    Design a function for the learning path generator that determines whether a specific learning module exists within the current curriculum sequence and identifies its position in the learning path. The function should accept a sequence of learning module IDs and a target module ID, returning both whether the module is available in the curriculum and its sequence position to help track student progress and prerequisite completion. If the module isn't found in the curriculum, indicate its absence with a position value of -1.
    

    
def sequential_search(dlist, item):
    """
    Design a function for the learning path generator that determines whether a specific learning module exists within the current curriculum sequence and identifies its position in the learning path. The function should accept a sequence of learning module IDs and a target module ID, returning both whether the module is available in the curriculum and its sequence position to help track student progress and prerequisite completion. If the module isn't found in the curriculum, indicate its absence with a position value of -1.
    

    """
def sequential_search(dlist, item):
    """
    Design a function for the learning path generator that determines whether a specific learning module exists within the current curriculum sequence and identifies its position in the learning path. The function should accept a sequence of learning module IDs and a target module ID, returning both whether the module is available in the curriculum and its sequence position to help track student progress and prerequisite completion. If the module isn't found in the curriculum, indicate its absence with a position value of -1.
    

    """
    pos = 0
    found = False
    while pos < len(dlist) and (not found):
        if dlist[pos] == item:
            found = True
        else:
            pos = pos + 1
    return (found, pos)