You have to answer other people’s questions.
Answer:
Please check the attachment.
Explanation:
The adjacency matrix is the matrix that has nodes as rows and columns. The nodes if connected is stated as 1 or else 0. And the adjacency list representation is the list with nodes and connected nodes. The nodes that are not connected are not being listed. The diagram and list as well as matrix can be found in the attachment.
<span>Actually dod requires a digital type of authentication and a secure password inorder to access sensitive data on mobile devices and email, which may in the form of two step authentication code, then in the form digital phone calls, and then in the form of alphanumeric passwords and finally in the form of finger prints authentications or face recognition verification..</span>
L is a decidable language because the Turing machine accepts it.
L is a recognizable language if TM M recognizes it.
<h3>How do you know if a language is decidable?</h3>
A language is said to be decidable only when there seems to exists a Turing machine that is said to accepts it,
Here, it tends to halts on all inputs, and then it answers "Yes" on words that is seen in the language and says "No" on words that are not found in the language. The same scenario applies to recognizable language.
So, L is a decidable language because the Turing machine accepts it.
L is a recognizable language if TM M recognizes it.
Learn more about programming language from
brainly.com/question/16936315
#SPJ1
