K. K. Wagh Polytechnic, Nashik. Hirabai HaridasVidyanagari, Amrutdham, Panchavati, Nashik-422003 Department of Artificial Intelligence & Machine Learning Programme: AIML Course: Advanced Algorithms in Al and ML Course Code: 22683 Semester: VI Academic Year: 2023-24 Class: TYAN ASSIGNMENT 4 UNIT NO 4: Unsupervised Learning: Clustering Algorithms. 1. What is K-Means Clustering? 2. Is it possible to have two cluster centers of different sizes? If yes, then how? 3. What are advantages and disadvantages of using K-Means Clustering? 4. What do you understand about dimensionality reduction? 5. Explain the concept of inertia in the context of K-Means Clustering. 6. How do you determine the optimal value of K in K-Mcans Clustering? 7. How does K-Means handle outliers? 8. What is Dimensionality Reduction? 9. Explain the significance of Dimensionality Reduction. 10.What is PCA? What does a PCA do? 11. List down the steps of a PCA algorithm. 12. What are the properties of Principal Components in PCA?