Moiz (Project Manager) Mashood (Hardware Development) Khizer (Software Development)Moiz (Prototyping and Testing)Under the leadership of Moiz, the team successfully completed the automatic plantNew chat User Write an assignment include two different topics the one is "difference between informed and uninformed search it's types and explain real life examples " and the another topic which is " difference between strong AI and strong method " keeping in view that every topic is explained separately and explainsd well that assignment can contain more than 5000 words ChatGPT Introduction This assignment aims to discuss two different topics. The first topic is about the difference between informed and uninformed search, its types, and real-life examples. The second topic is about the difference between strong AI and strong method. Both of these topics are significant in the field of artificial intelligence and will be discussed in detail below. Topic 1: Difference between Informed and Uninformed Search, Types, and Real-Life Examples In artificial intelligence, a search algorithm is a way of finding a solution to a problem. A search algorithm can be informed or uninformed. Informed search algorithms use heuristic functions to guide the search towards a goal, while uninformed search algorithms do not use any heuristic function. In this section, we will discuss the difference between informed and uninformed search, its types, and real-life examples. 1.1 Difference between Informed and Uninformed Search The main difference between informed and uninformed search is the use of heuristic functions. Heuristics are problem-solving techniques that use a practical approach to find a solution, but not necessarily the best solution. Informed search algorithms use heuristic functions to guide the search towards a goal, while uninformed search algorithms do not use any heuristic function. Informed search algorithms are more efficient than uninformed search algorithms because they use information about the problem to guide the search. For example, in the A* search algorithm, which is an informed search algorithm, the algorithm uses a heuristic function to estimate the cost of the solution from the current node to the goal node. This information helps the algorithm to make informed decisions about which node to expand next. On the other hand, uninformed search algorithms do not use any heuristic function to guide the search. For example, in the depth-first search algorithm, which is an uninformed search algorithm, the algorithm starts at the root node and explores as far as possible along each branch before backtracking. This algorithm is not very efficient because it does not take into account any information about the problem. 1.2 Types of Informed and Uninformed Search Algorithms There are several types of informed and uninformed search algorithms. In this section, we will discuss some of the most commonly used search algorithms. 1.2.1 Uninformed Sear