show the answer by writing a 5-tuple and some explanation is enough

Problem 5. [14 points] Consider the following setting. There are k processes that share a common resource (for example a printer). Let the symbols 7,8,, i=1,...,k denote respectively the request by process i and the granting to process i of the resource. An execution is a string over the alphabet ? = {ri,8,...,1,8}. For example, the string 188,8, indicates that first process 1 requests the resource, then process 2 requests it, then process 1 is granted the resource, and finally process 2 is granted it. Call an execution w=a,a, a, e incomplete if some process requests the resource in some step and is not granted it at any later step, i.e. if a;=r; for some j, i and there does not exist a l>j such that a, = 8; ; otherwise the execution is complete. For example, the executions rgir, 172828218, are incomplete, whereas 112882, 821728282118, are complete (note that a grant to a process i satisfies all its previous requests). Let D. be the set of incomplete executions (strings). a. Give an NFA with k+1 states that accepts the language D. b. Give a DFA that accepts D. Justify your answers. Problem 5. [14 points] Consider the following setting. There are k processes that share a common resource (for example a printer). Let the symbols 7,8,, i=1,...,k denote respectively the request by process i and the granting to process i of the resource. An execution is a string over the alphabet ? = {ri,8,...,1,8}. For example, the string 188,8, indicates that first process 1 requests the resource, then process 2 requests it, then process 1 is granted the resource, and finally process 2 is granted it. Call an execution w=a,a, a, e incomplete if some process requests the resource in some step and is not granted it at any later step, i.e. if a;=r; for some j, i and there does not exist a l>j such that a, = 8; ; otherwise the execution is complete. For example, the executions rgir, 172828218, are incomplete, whereas 112882, 821728282118, are complete (note that a grant to a process i satisfies all its previous requests). Let D. be the set of incomplete executions (strings). a. Give an NFA with k+1 states that accepts the language D. b. Give a DFA that accepts D. Justify your answers