You will write applications for diverse areas of life. Abstractions, Implementations, and Interfaces are not just fundamental points of computational theory, also fundamental points of human reasoning and understanding. Give an example from real life (or hypothetical one) where people mixing (intentionally or not) Abstraction with Implementation. For example, when they talk about an implementation, also praising/criticizing an abstract model/type it is based on. It is often seen/used in advertising, marketing, and politics. Comment on Linus Torvalds saying Bad programmers worry about the code. Good programmers worry about data structures and their relationships." How do you relate this to topics of this course? Give examples of applications for Degree of a graph Node and Total Degree of a graph. Example: I built such ... application based on graph in which node degree describes ... and Total Degree defines ... Draw directed graph represented by the following sets V= {a, b, c, d, e, f, g} E = {(cb),(b,a),(a,b),(a,c),(c,e),(ca),(b,d),(d,C),(e,a),(e,b),(d,e)} You used a graph in your application to describe connections between people. a. What will be the most informative state of the graph in your opinion: connected, disconnected, complete, or sparse? Explain. b. What information Cliques of such graph carry for you? a. Some ADT (Abstract Data Types) can be defined/built using other ADTs. Specify which ADTs you can use as a base for the following types: List: b. Stack: C. Queue: d. Tree: e. Graph: You will write applications for diverse areas of life. Abstractions, Implementations, and Interfaces are not just fundamental points of computational theory, also fundamental points of human reasoning and understanding. Give an example from real life (or hypothetical one) where people mixing (intentionally or not) Abstraction with Implementation. For example, when they talk about an implementation, also praising/criticizing an abstract model/type it is based on. It is often seen/used in advertising, marketing, and politics. Comment on Linus Torvalds saying Bad programmers worry about the code. Good programmers worry about data structures and their relationships." How do you relate this to topics of this course? Give examples of applications for Degree of a graph Node and Total Degree of a graph. Example: I built such ... application based on graph in which node degree describes ... and Total Degree defines ... Draw directed graph represented by the following sets V= {a, b, c, d, e, f, g} E = {(cb),(b,a),(a,b),(a,c),(c,e),(ca),(b,d),(d,C),(e,a),(e,b),(d,e)} You used a graph in your application to describe connections between people. a. What will be the most informative state of the graph in your opinion: connected, disconnected, complete, or sparse? Explain. b. What information Cliques of such graph carry for you? a. Some ADT (Abstract Data Types) can be defined/built using other ADTs. Specify which ADTs you can use as a base for the following types: List: b. Stack: C. Queue: d. Tree: e. Graph